./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 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml', '-i', '../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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.3.0-?-4f9af40 [2024-11-08 00:34:13,052 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 00:34:13,123 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-08 00:34:13,128 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 00:34:13,130 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 00:34:13,163 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 00:34:13,164 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 00:34:13,164 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 00:34:13,164 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 00:34:13,164 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 00:34:13,164 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 00:34:13,164 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 00:34:13,164 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 00:34:13,165 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-08 00:34:13,165 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-08 00:34:13,165 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-08 00:34:13,165 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-08 00:34:13,165 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-08 00:34:13,165 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-08 00:34:13,165 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 00:34:13,167 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-08 00:34:13,167 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 00:34:13,167 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 00:34:13,168 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 00:34:13,168 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 00:34:13,168 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-08 00:34:13,168 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-08 00:34:13,168 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-08 00:34:13,168 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 00:34:13,168 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 00:34:13,168 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 00:34:13,168 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 00:34:13,168 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-08 00:34:13,169 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 00:34:13,169 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 00:34:13,169 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 00:34:13,170 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 00:34:13,170 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 00:34:13,170 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-08 00:34:13,170 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/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-08 00:34:13,461 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 00:34:13,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 00:34:13,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 00:34:13,477 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 00:34:13,478 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 00:34:13,479 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2024-11-08 00:34:14,751 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 00:34:14,946 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 00:34:14,947 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2024-11-08 00:34:14,954 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7d1eab86/d0fa453cfb2a4928a45d23de11e75968/FLAGe1caee77d [2024-11-08 00:34:14,977 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7d1eab86/d0fa453cfb2a4928a45d23de11e75968 [2024-11-08 00:34:14,980 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 00:34:14,982 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 00:34:14,984 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 00:34:14,984 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 00:34:14,988 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 00:34:14,989 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:34:14" (1/1) ... [2024-11-08 00:34:14,991 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a61e323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:34:14, skipping insertion in model container [2024-11-08 00:34:14,992 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:34:14" (1/1) ... [2024-11-08 00:34:15,006 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 00:34:15,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 00:34:15,156 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 00:34:15,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 00:34:15,197 INFO L204 MainTranslator]: Completed translation [2024-11-08 00:34:15,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:34:15 WrapperNode [2024-11-08 00:34:15,198 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 00:34:15,199 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 00:34:15,200 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 00:34:15,200 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 00:34:15,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:34:15" (1/1) ... [2024-11-08 00:34:15,217 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:34:15" (1/1) ... [2024-11-08 00:34:15,236 INFO L138 Inliner]: procedures = 16, calls = 63, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2024-11-08 00:34:15,238 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 00:34:15,238 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 00:34:15,239 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 00:34:15,239 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 00:34:15,245 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:34:15" (1/1) ... [2024-11-08 00:34:15,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:34:15" (1/1) ... [2024-11-08 00:34:15,248 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:34:15" (1/1) ... [2024-11-08 00:34:15,271 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-08 00:34:15,272 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:34:15" (1/1) ... [2024-11-08 00:34:15,272 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:34:15" (1/1) ... [2024-11-08 00:34:15,281 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:34:15" (1/1) ... [2024-11-08 00:34:15,283 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:34:15" (1/1) ... [2024-11-08 00:34:15,287 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:34:15" (1/1) ... [2024-11-08 00:34:15,292 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:34:15" (1/1) ... [2024-11-08 00:34:15,294 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 00:34:15,295 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 00:34:15,295 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 00:34:15,295 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 00:34:15,300 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:34:15" (1/1) ... [2024-11-08 00:34:15,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:34:15,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:34:15,337 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 00:34:15,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-08 00:34:15,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 00:34:15,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 00:34:15,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 00:34:15,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 00:34:15,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-08 00:34:15,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-08 00:34:15,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-08 00:34:15,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 00:34:15,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 00:34:15,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 00:34:15,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 00:34:15,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-08 00:34:15,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-08 00:34:15,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-08 00:34:15,362 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2024-11-08 00:34:15,362 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2024-11-08 00:34:15,363 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2024-11-08 00:34:15,363 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2024-11-08 00:34:15,363 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_26_0 [2024-11-08 00:34:15,363 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_26_0 [2024-11-08 00:34:15,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 00:34:15,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 00:34:15,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 00:34:15,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 00:34:15,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 00:34:15,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-08 00:34:15,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-08 00:34:15,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-08 00:34:15,364 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_27_0 [2024-11-08 00:34:15,364 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_27_0 [2024-11-08 00:34:15,364 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_27_0 [2024-11-08 00:34:15,364 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_27_0 [2024-11-08 00:34:15,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 00:34:15,470 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 00:34:15,471 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 00:34:15,745 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-08 00:34:15,746 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 00:34:15,760 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 00:34:15,760 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 00:34:15,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:34:15 BoogieIcfgContainer [2024-11-08 00:34:15,761 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 00:34:15,762 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-08 00:34:15,762 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-08 00:34:15,766 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-08 00:34:15,767 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-08 00:34:15,767 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.11 12:34:14" (1/3) ... [2024-11-08 00:34:15,768 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@335863f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.11 12:34:15, skipping insertion in model container [2024-11-08 00:34:15,768 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-08 00:34:15,769 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:34:15" (2/3) ... [2024-11-08 00:34:15,769 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@335863f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.11 12:34:15, skipping insertion in model container [2024-11-08 00:34:15,770 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-08 00:34:15,770 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:34:15" (3/3) ... [2024-11-08 00:34:15,771 INFO L332 chiAutomizerObserver]: Analyzing ICFG recursified_nested_5.c [2024-11-08 00:34:15,819 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-08 00:34:15,819 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-08 00:34:15,819 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-08 00:34:15,819 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-08 00:34:15,820 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-08 00:34:15,820 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-08 00:34:15,820 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-08 00:34:15,820 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-08 00:34:15,825 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-08 00:34:15,844 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-08 00:34:15,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:34:15,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:34:15,852 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-08 00:34:15,852 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 00:34:15,852 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-08 00:34:15,853 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-08 00:34:15,857 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-08 00:34:15,857 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:34:15,857 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:34:15,857 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-08 00:34:15,858 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 00:34:15,863 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-08 00:34:15,864 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-08 00:34:15,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:15,869 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 1 times [2024-11-08 00:34:15,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:15,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700037087] [2024-11-08 00:34:15,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:15,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:16,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:16,008 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:34:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:16,060 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:34:16,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:16,064 INFO L85 PathProgramCache]: Analyzing trace with hash 2053320187, now seen corresponding path program 1 times [2024-11-08 00:34:16,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:16,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031768862] [2024-11-08 00:34:16,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:16,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:16,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:16,492 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-08 00:34:16,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 00:34:16,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031768862] [2024-11-08 00:34:16,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031768862] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 00:34:16,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 00:34:16,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 00:34:16,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991017974] [2024-11-08 00:34:16,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 00:34:16,497 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-08 00:34:16,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 00:34:16,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 00:34:16,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 00:34:16,523 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-08 00:34:16,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 00:34:16,822 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2024-11-08 00:34:16,823 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 76 transitions. [2024-11-08 00:34:16,828 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-08 00:34:16,838 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 42 states and 53 transitions. [2024-11-08 00:34:16,840 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-08 00:34:16,840 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-08 00:34:16,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 53 transitions. [2024-11-08 00:34:16,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 00:34:16,842 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 53 transitions. [2024-11-08 00:34:16,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 53 transitions. [2024-11-08 00:34:16,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2024-11-08 00:34:16,868 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-08 00:34:16,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2024-11-08 00:34:16,872 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-11-08 00:34:16,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 00:34:16,876 INFO L425 stractBuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-11-08 00:34:16,876 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-08 00:34:16,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 44 transitions. [2024-11-08 00:34:16,880 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-08 00:34:16,880 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:34:16,880 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:34:16,881 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-08 00:34:16,881 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-08 00:34:16,882 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-08 00:34:16,882 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-08 00:34:16,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:16,884 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 2 times [2024-11-08 00:34:16,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:16,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24465216] [2024-11-08 00:34:16,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:16,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:16,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:16,945 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:34:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:16,970 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:34:16,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:16,972 INFO L85 PathProgramCache]: Analyzing trace with hash 54735792, now seen corresponding path program 1 times [2024-11-08 00:34:16,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:16,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391425502] [2024-11-08 00:34:16,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:16,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:16,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:17,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:17,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:17,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:17,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:17,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 00:34:17,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:17,387 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-08 00:34:17,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 00:34:17,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391425502] [2024-11-08 00:34:17,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391425502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 00:34:17,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 00:34:17,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 00:34:17,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552095526] [2024-11-08 00:34:17,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 00:34:17,392 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-08 00:34:17,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 00:34:17,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 00:34:17,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 00:34:17,393 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-08 00:34:17,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 00:34:17,600 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2024-11-08 00:34:17,600 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 52 transitions. [2024-11-08 00:34:17,603 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-08 00:34:17,606 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 52 transitions. [2024-11-08 00:34:17,608 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-08 00:34:17,608 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-08 00:34:17,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 52 transitions. [2024-11-08 00:34:17,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 00:34:17,609 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 52 transitions. [2024-11-08 00:34:17,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 52 transitions. [2024-11-08 00:34:17,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2024-11-08 00:34:17,612 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-08 00:34:17,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2024-11-08 00:34:17,613 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 46 transitions. [2024-11-08 00:34:17,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 00:34:17,616 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 46 transitions. [2024-11-08 00:34:17,616 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-08 00:34:17,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 46 transitions. [2024-11-08 00:34:17,617 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-08 00:34:17,617 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:34:17,617 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:34:17,620 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-08 00:34:17,620 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-08 00:34:17,621 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-08 00:34:17,621 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-08 00:34:17,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:17,621 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 3 times [2024-11-08 00:34:17,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:17,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404751852] [2024-11-08 00:34:17,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:17,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:17,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:17,645 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:34:17,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:17,658 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:34:17,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:17,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1525796123, now seen corresponding path program 1 times [2024-11-08 00:34:17,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:17,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424247953] [2024-11-08 00:34:17,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:17,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:17,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:17,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:17,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:18,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:18,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:18,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 00:34:18,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:18,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 00:34:18,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:18,212 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-08 00:34:18,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 00:34:18,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424247953] [2024-11-08 00:34:18,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424247953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 00:34:18,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 00:34:18,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 00:34:18,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535351942] [2024-11-08 00:34:18,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 00:34:18,213 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-08 00:34:18,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 00:34:18,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 00:34:18,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-08 00:34:18,215 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-08 00:34:18,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 00:34:18,396 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2024-11-08 00:34:18,396 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 51 transitions. [2024-11-08 00:34:18,397 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-08 00:34:18,398 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 51 transitions. [2024-11-08 00:34:18,398 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-08 00:34:18,398 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-08 00:34:18,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 51 transitions. [2024-11-08 00:34:18,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 00:34:18,399 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 51 transitions. [2024-11-08 00:34:18,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 51 transitions. [2024-11-08 00:34:18,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2024-11-08 00:34:18,402 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-08 00:34:18,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2024-11-08 00:34:18,402 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-11-08 00:34:18,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 00:34:18,403 INFO L425 stractBuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-11-08 00:34:18,404 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-08 00:34:18,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 48 transitions. [2024-11-08 00:34:18,404 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-08 00:34:18,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:34:18,405 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:34:18,405 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-08 00:34:18,406 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-08 00:34:18,406 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-08 00:34:18,406 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-08 00:34:18,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:18,407 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 4 times [2024-11-08 00:34:18,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:18,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666091827] [2024-11-08 00:34:18,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:18,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:18,423 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:34:18,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:18,434 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:34:18,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:18,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1439872263, now seen corresponding path program 1 times [2024-11-08 00:34:18,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:18,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676888457] [2024-11-08 00:34:18,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:18,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:18,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:18,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:18,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:18,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:18,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:18,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:18,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:18,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:18,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:18,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 00:34:18,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:18,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 00:34:18,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:18,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 00:34:19,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:19,004 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-08 00:34:19,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 00:34:19,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676888457] [2024-11-08 00:34:19,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676888457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 00:34:19,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 00:34:19,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 00:34:19,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346529296] [2024-11-08 00:34:19,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 00:34:19,005 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-08 00:34:19,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 00:34:19,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 00:34:19,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 00:34:19,006 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-08 00:34:19,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 00:34:19,187 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2024-11-08 00:34:19,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 50 transitions. [2024-11-08 00:34:19,188 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-08 00:34:19,189 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 50 transitions. [2024-11-08 00:34:19,189 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-08 00:34:19,189 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-08 00:34:19,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 50 transitions. [2024-11-08 00:34:19,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 00:34:19,190 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 50 transitions. [2024-11-08 00:34:19,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 50 transitions. [2024-11-08 00:34:19,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-08 00:34:19,196 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-08 00:34:19,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2024-11-08 00:34:19,196 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 50 transitions. [2024-11-08 00:34:19,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 00:34:19,198 INFO L425 stractBuchiCegarLoop]: Abstraction has 42 states and 50 transitions. [2024-11-08 00:34:19,198 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-08 00:34:19,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 50 transitions. [2024-11-08 00:34:19,199 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-08 00:34:19,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:34:19,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:34:19,200 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-08 00:34:19,200 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-08 00:34:19,200 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-08 00:34:19,200 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-08 00:34:19,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:19,203 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 5 times [2024-11-08 00:34:19,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:19,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461626554] [2024-11-08 00:34:19,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:19,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:19,224 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:34:19,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:19,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:34:19,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:19,239 INFO L85 PathProgramCache]: Analyzing trace with hash 405682375, now seen corresponding path program 1 times [2024-11-08 00:34:19,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:19,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215922360] [2024-11-08 00:34:19,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:19,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:19,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:19,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:19,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:19,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:19,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:19,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:19,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:20,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:20,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:20,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:20,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-08 00:34:20,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:20,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 00:34:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:20,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 00:34:20,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:20,254 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-08 00:34:20,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 00:34:20,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215922360] [2024-11-08 00:34:20,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215922360] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 00:34:20,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473063372] [2024-11-08 00:34:20,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:20,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 00:34:20,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:34:20,259 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 00:34:20,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 00:34:20,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:20,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-08 00:34:20,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:34:20,491 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-08 00:34:20,741 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-08 00:34:20,741 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 00:34:21,505 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-08 00:34:21,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473063372] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 00:34:21,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 00:34:21,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 29 [2024-11-08 00:34:21,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549987845] [2024-11-08 00:34:21,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 00:34:21,507 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-08 00:34:21,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 00:34:21,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-08 00:34:21,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2024-11-08 00:34:21,508 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-08 00:34:22,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 00:34:22,219 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2024-11-08 00:34:22,219 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 54 transitions. [2024-11-08 00:34:22,221 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-08 00:34:22,221 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 54 transitions. [2024-11-08 00:34:22,221 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2024-11-08 00:34:22,222 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2024-11-08 00:34:22,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 54 transitions. [2024-11-08 00:34:22,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 00:34:22,222 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-11-08 00:34:22,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 54 transitions. [2024-11-08 00:34:22,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-08 00:34:22,225 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-08 00:34:22,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2024-11-08 00:34:22,225 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-11-08 00:34:22,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-08 00:34:22,226 INFO L425 stractBuchiCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-11-08 00:34:22,226 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-08 00:34:22,226 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 54 transitions. [2024-11-08 00:34:22,227 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-08 00:34:22,227 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:34:22,227 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:34:22,228 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-08 00:34:22,229 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-08 00:34:22,229 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-08 00:34:22,229 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-08 00:34:22,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:22,229 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 6 times [2024-11-08 00:34:22,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:22,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060798013] [2024-11-08 00:34:22,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:22,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:22,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:22,249 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:34:22,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:22,261 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:34:22,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:22,263 INFO L85 PathProgramCache]: Analyzing trace with hash 688040901, now seen corresponding path program 2 times [2024-11-08 00:34:22,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:22,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038803970] [2024-11-08 00:34:22,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:22,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:22,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:22,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:23,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:23,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:23,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:23,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:23,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:23,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:23,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:23,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:23,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:23,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:23,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 00:34:23,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:23,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:23,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:23,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:23,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:23,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 00:34:23,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:23,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 00:34:23,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:23,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 00:34:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:23,861 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-08 00:34:23,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 00:34:23,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038803970] [2024-11-08 00:34:23,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038803970] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 00:34:23,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218035780] [2024-11-08 00:34:23,862 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 00:34:23,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 00:34:23,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:34:23,865 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 00:34:23,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 00:34:24,021 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 00:34:24,021 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 00:34:24,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-11-08 00:34:24,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:34:24,109 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-08 00:34:24,386 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-08 00:34:24,386 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 00:34:25,688 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-08 00:34:25,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218035780] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 00:34:25,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 00:34:25,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 14] total 34 [2024-11-08 00:34:25,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694813046] [2024-11-08 00:34:25,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 00:34:25,689 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-08 00:34:25,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 00:34:25,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-08 00:34:25,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=949, Unknown=0, NotChecked=0, Total=1122 [2024-11-08 00:34:25,690 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-08 00:34:26,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 00:34:26,224 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2024-11-08 00:34:26,224 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 58 transitions. [2024-11-08 00:34:26,225 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-08 00:34:26,226 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 58 transitions. [2024-11-08 00:34:26,226 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2024-11-08 00:34:26,227 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2024-11-08 00:34:26,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 58 transitions. [2024-11-08 00:34:26,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 00:34:26,227 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 58 transitions. [2024-11-08 00:34:26,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 58 transitions. [2024-11-08 00:34:26,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-08 00:34:26,233 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-08 00:34:26,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2024-11-08 00:34:26,236 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 58 transitions. [2024-11-08 00:34:26,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 00:34:26,239 INFO L425 stractBuchiCegarLoop]: Abstraction has 50 states and 58 transitions. [2024-11-08 00:34:26,239 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-08 00:34:26,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 58 transitions. [2024-11-08 00:34:26,240 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-08 00:34:26,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:34:26,240 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:34:26,242 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-08 00:34:26,242 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-08 00:34:26,242 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-08 00:34:26,242 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-08 00:34:26,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:26,246 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 7 times [2024-11-08 00:34:26,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:26,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715773039] [2024-11-08 00:34:26,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:26,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:26,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:26,259 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:34:26,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:26,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:34:26,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:26,267 INFO L85 PathProgramCache]: Analyzing trace with hash 2100163973, now seen corresponding path program 3 times [2024-11-08 00:34:26,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:26,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681811676] [2024-11-08 00:34:26,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:26,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:26,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:26,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:27,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:27,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:27,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:27,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:27,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:27,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:27,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:27,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:27,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:27,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:27,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 00:34:27,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:27,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:27,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:27,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:27,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:27,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:27,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:27,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:27,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:27,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:27,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 00:34:27,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:27,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 00:34:27,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:27,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 00:34:27,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:27,698 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-08 00:34:27,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 00:34:27,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681811676] [2024-11-08 00:34:27,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681811676] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 00:34:27,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929237526] [2024-11-08 00:34:27,698 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 00:34:27,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 00:34:27,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:34:27,701 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 00:34:27,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 00:34:27,839 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-08 00:34:27,839 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 00:34:27,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-08 00:34:27,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:34:27,855 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-08 00:34:28,030 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-08 00:34:28,031 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 00:34:28,531 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-08 00:34:28,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929237526] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 00:34:28,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 00:34:28,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 10] total 27 [2024-11-08 00:34:28,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013825292] [2024-11-08 00:34:28,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 00:34:28,532 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-08 00:34:28,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 00:34:28,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-08 00:34:28,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2024-11-08 00:34:28,533 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-08 00:34:29,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 00:34:29,048 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2024-11-08 00:34:29,048 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 62 transitions. [2024-11-08 00:34:29,049 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-08 00:34:29,050 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 62 transitions. [2024-11-08 00:34:29,050 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2024-11-08 00:34:29,050 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2024-11-08 00:34:29,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 62 transitions. [2024-11-08 00:34:29,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 00:34:29,051 INFO L218 hiAutomatonCegarLoop]: Abstraction has 54 states and 62 transitions. [2024-11-08 00:34:29,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 62 transitions. [2024-11-08 00:34:29,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-08 00:34:29,057 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-08 00:34:29,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2024-11-08 00:34:29,057 INFO L240 hiAutomatonCegarLoop]: Abstraction has 54 states and 62 transitions. [2024-11-08 00:34:29,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 00:34:29,061 INFO L425 stractBuchiCegarLoop]: Abstraction has 54 states and 62 transitions. [2024-11-08 00:34:29,061 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-08 00:34:29,061 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 62 transitions. [2024-11-08 00:34:29,062 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-08 00:34:29,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:34:29,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:34:29,069 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-08 00:34:29,069 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-08 00:34:29,069 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-08 00:34:29,070 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-08 00:34:29,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:29,075 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 8 times [2024-11-08 00:34:29,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:29,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816203319] [2024-11-08 00:34:29,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:29,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:29,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:29,088 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:34:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:29,095 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:34:29,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:29,096 INFO L85 PathProgramCache]: Analyzing trace with hash -405832049, now seen corresponding path program 4 times [2024-11-08 00:34:29,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:29,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408392857] [2024-11-08 00:34:29,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:29,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:31,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:31,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:32,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:32,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:33,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:33,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:33,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:33,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:33,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:33,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:33,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:33,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:33,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:33,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:33,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:33,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 00:34:33,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:33,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:33,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:33,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:33,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:33,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:33,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:33,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:33,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:33,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:33,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 00:34:33,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:33,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 00:34:34,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 00:34:34,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 00:34:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 00:34:34,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 00:34:34,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 00:34:34,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 00:34:34,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 00:34:34,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 00:34:34,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 00:34:34,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 00:34:34,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 00:34:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,417 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-08 00:34:34,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 00:34:34,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408392857] [2024-11-08 00:34:34,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408392857] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 00:34:34,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328917633] [2024-11-08 00:34:34,419 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-08 00:34:34,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 00:34:34,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:34:34,422 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 00:34:34,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 00:34:34,844 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-08 00:34:34,844 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 00:34:34,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 2044 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-08 00:34:34,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:34:34,895 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-08 00:34:35,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 00:34:35,149 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-08 00:34:35,168 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-08 00:34:35,168 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 00:34:36,761 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-08 00:34:36,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328917633] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 00:34:36,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 00:34:36,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 14] total 40 [2024-11-08 00:34:36,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180889131] [2024-11-08 00:34:36,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 00:34:36,763 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-08 00:34:36,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 00:34:36,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-08 00:34:36,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1380, Unknown=0, NotChecked=0, Total=1560 [2024-11-08 00:34:36,764 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-08 00:34:37,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 00:34:37,447 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2024-11-08 00:34:37,447 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 66 transitions. [2024-11-08 00:34:37,448 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-08 00:34:37,450 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 66 transitions. [2024-11-08 00:34:37,450 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2024-11-08 00:34:37,450 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2024-11-08 00:34:37,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 66 transitions. [2024-11-08 00:34:37,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 00:34:37,451 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 66 transitions. [2024-11-08 00:34:37,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 66 transitions. [2024-11-08 00:34:37,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-08 00:34:37,456 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-08 00:34:37,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2024-11-08 00:34:37,457 INFO L240 hiAutomatonCegarLoop]: Abstraction has 58 states and 66 transitions. [2024-11-08 00:34:37,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-08 00:34:37,457 INFO L425 stractBuchiCegarLoop]: Abstraction has 58 states and 66 transitions. [2024-11-08 00:34:37,457 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-08 00:34:37,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 66 transitions. [2024-11-08 00:34:37,458 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-08 00:34:37,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:34:37,458 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:34:37,465 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-08 00:34:37,467 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-08 00:34:37,467 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-08 00:34:37,468 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-08 00:34:37,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:37,472 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 9 times [2024-11-08 00:34:37,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:37,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70323153] [2024-11-08 00:34:37,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:37,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:37,485 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:34:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:37,492 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:34:37,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:37,493 INFO L85 PathProgramCache]: Analyzing trace with hash 564681231, now seen corresponding path program 5 times [2024-11-08 00:34:37,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:37,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835818616] [2024-11-08 00:34:37,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:37,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:37,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:39,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:40,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:41,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:42,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:42,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:42,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:42,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:42,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:42,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:42,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:42,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 00:34:43,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 00:34:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 00:34:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 00:34:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 00:34:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 00:34:43,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 00:34:43,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 00:34:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-08 00:34:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 00:34:43,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 00:34:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 00:34:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 00:34:43,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 00:34:43,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 00:34:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 00:34:43,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 00:34:43,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-08 00:34:43,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:43,762 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-08 00:34:43,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 00:34:43,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835818616] [2024-11-08 00:34:43,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835818616] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 00:34:43,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588413172] [2024-11-08 00:34:43,763 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-08 00:34:43,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 00:34:43,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:34:43,766 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 00:34:43,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 00:34:46,750 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2024-11-08 00:34:46,750 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 00:34:46,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 1743 conjuncts, 105 conjuncts are in the unsatisfiable core [2024-11-08 00:34:46,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:34:46,777 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-08 00:34:47,208 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-08 00:34:47,208 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 00:34:51,705 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-08 00:34:51,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588413172] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 00:34:51,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 00:34:51,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 13, 26] total 56 [2024-11-08 00:34:51,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444715442] [2024-11-08 00:34:51,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 00:34:51,707 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-08 00:34:51,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 00:34:51,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-11-08 00:34:51,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=2645, Unknown=0, NotChecked=0, Total=3080 [2024-11-08 00:34:51,709 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-08 00:34:52,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 00:34:52,778 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2024-11-08 00:34:52,778 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 71 transitions. [2024-11-08 00:34:52,779 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-08 00:34:52,781 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 62 states and 71 transitions. [2024-11-08 00:34:52,781 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2024-11-08 00:34:52,781 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2024-11-08 00:34:52,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 71 transitions. [2024-11-08 00:34:52,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 00:34:52,781 INFO L218 hiAutomatonCegarLoop]: Abstraction has 62 states and 71 transitions. [2024-11-08 00:34:52,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 71 transitions. [2024-11-08 00:34:52,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2024-11-08 00:34:52,786 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-08 00:34:52,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2024-11-08 00:34:52,787 INFO L240 hiAutomatonCegarLoop]: Abstraction has 60 states and 68 transitions. [2024-11-08 00:34:52,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 00:34:52,788 INFO L425 stractBuchiCegarLoop]: Abstraction has 60 states and 68 transitions. [2024-11-08 00:34:52,788 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-08 00:34:52,788 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 68 transitions. [2024-11-08 00:34:52,789 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-08 00:34:52,789 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:34:52,789 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:34:52,793 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-08 00:34:52,793 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-08 00:34:52,793 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-08 00:34:52,794 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-08 00:34:52,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:52,795 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 10 times [2024-11-08 00:34:52,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:52,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454913056] [2024-11-08 00:34:52,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:52,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:52,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:52,810 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:34:52,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:52,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:34:52,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:52,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1926303055, now seen corresponding path program 6 times [2024-11-08 00:34:52,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:52,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835523845] [2024-11-08 00:34:52,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:52,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:54,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:55,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:55,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:56,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:56,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:56,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:56,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:56,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:56,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:56,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:56,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:56,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:56,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:56,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:56,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:56,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:56,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:34:56,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:34:57,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:34:57,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 00:34:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:34:57,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:34:57,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:34:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 00:34:57,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-11-08 00:34:57,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:34:57,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:34:57,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:34:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 00:34:57,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:34:57,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:57,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:57,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:58,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:58,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:58,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:58,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:58,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:58,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:58,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:58,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:58,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:34:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:58,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:58,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:58,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:58,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:58,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:58,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:58,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:58,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:58,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:58,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:58,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:58,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:34:58,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:58,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 00:34:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:58,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-11-08 00:34:58,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:58,098 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-08 00:34:58,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 00:34:58,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835523845] [2024-11-08 00:34:58,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835523845] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 00:34:58,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253510719] [2024-11-08 00:34:58,098 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-08 00:34:58,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 00:34:58,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:34:58,101 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 00:34:58,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 00:34:58,565 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-11-08 00:34:58,565 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 00:34:58,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-08 00:34:58,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:34:58,580 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-08 00:34:58,761 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-08 00:34:58,761 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 00:35:00,756 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-08 00:35:00,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253510719] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 00:35:00,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 00:35:00,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 14] total 36 [2024-11-08 00:35:00,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118384186] [2024-11-08 00:35:00,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 00:35:00,759 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-08 00:35:00,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 00:35:00,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-08 00:35:00,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1104, Unknown=0, NotChecked=0, Total=1260 [2024-11-08 00:35:00,761 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-08 00:35:01,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 00:35:01,410 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2024-11-08 00:35:01,410 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 72 transitions. [2024-11-08 00:35:01,411 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-08 00:35:01,412 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 64 states and 72 transitions. [2024-11-08 00:35:01,412 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2024-11-08 00:35:01,413 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2024-11-08 00:35:01,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 72 transitions. [2024-11-08 00:35:01,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 00:35:01,413 INFO L218 hiAutomatonCegarLoop]: Abstraction has 64 states and 72 transitions. [2024-11-08 00:35:01,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 72 transitions. [2024-11-08 00:35:01,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-08 00:35:01,417 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-08 00:35:01,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2024-11-08 00:35:01,417 INFO L240 hiAutomatonCegarLoop]: Abstraction has 64 states and 72 transitions. [2024-11-08 00:35:01,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 00:35:01,418 INFO L425 stractBuchiCegarLoop]: Abstraction has 64 states and 72 transitions. [2024-11-08 00:35:01,418 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-08 00:35:01,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 72 transitions. [2024-11-08 00:35:01,419 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-08 00:35:01,419 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:35:01,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:35:01,425 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-08 00:35:01,425 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-08 00:35:01,425 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-08 00:35:01,426 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-08 00:35:01,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:35:01,427 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 11 times [2024-11-08 00:35:01,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:35:01,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617106218] [2024-11-08 00:35:01,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:35:01,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:35:01,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:35:01,439 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:35:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:35:01,448 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:35:01,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:35:01,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1878559914, now seen corresponding path program 7 times [2024-11-08 00:35:01,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:35:01,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54816950] [2024-11-08 00:35:01,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:35:01,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:35:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:09,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:10,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:10,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:10,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:10,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:10,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:10,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:10,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:10,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:10,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:10,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:10,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:10,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:10,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:10,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:10,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:10,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:11,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:11,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:11,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 00:35:11,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:11,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:11,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 00:35:11,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2024-11-08 00:35:11,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:11,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:12,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:12,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:12,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 00:35:12,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:12,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:12,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 00:35:12,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2024-11-08 00:35:12,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:12,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:12,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:12,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:13,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:13,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:13,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:13,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:13,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:13,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:13,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:13,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 00:35:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:13,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:13,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:13,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:13,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:13,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:13,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:13,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:13,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:13,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:13,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:13,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:13,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:13,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:13,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:13,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:13,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:13,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:13,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:13,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:13,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:13,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:13,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:13,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:13,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:13,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:13,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:13,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:13,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:13,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:13,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:13,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:13,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:13,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:13,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:13,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:13,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:13,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:13,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:13,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:13,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:13,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:13,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:13,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:13,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:13,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:13,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:13,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:13,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:13,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:13,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:13,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:13,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:13,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 00:35:13,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:13,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2024-11-08 00:35:13,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:13,366 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-08 00:35:13,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 00:35:13,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54816950] [2024-11-08 00:35:13,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54816950] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 00:35:13,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206255451] [2024-11-08 00:35:13,366 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-08 00:35:13,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 00:35:13,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:35:13,370 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 00:35:13,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 00:35:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:14,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 6364 conjuncts, 104 conjuncts are in the unsatisfiable core [2024-11-08 00:35:14,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:35:14,841 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-08 00:35:15,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 00:35:15,174 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-08 00:35:15,196 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-08 00:35:15,196 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 00:35:20,073 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-08 00:35:20,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206255451] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 00:35:20,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 00:35:20,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 22] total 43 [2024-11-08 00:35:20,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975147835] [2024-11-08 00:35:20,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 00:35:20,076 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-08 00:35:20,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 00:35:20,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-08 00:35:20,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=1514, Unknown=0, NotChecked=0, Total=1806 [2024-11-08 00:35:20,077 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-08 00:35:20,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 00:35:20,626 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2024-11-08 00:35:20,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 76 transitions. [2024-11-08 00:35:20,628 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-08 00:35:20,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 68 states and 76 transitions. [2024-11-08 00:35:20,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2024-11-08 00:35:20,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2024-11-08 00:35:20,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 76 transitions. [2024-11-08 00:35:20,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 00:35:20,629 INFO L218 hiAutomatonCegarLoop]: Abstraction has 68 states and 76 transitions. [2024-11-08 00:35:20,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 76 transitions. [2024-11-08 00:35:20,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-08 00:35:20,633 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-08 00:35:20,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2024-11-08 00:35:20,633 INFO L240 hiAutomatonCegarLoop]: Abstraction has 68 states and 76 transitions. [2024-11-08 00:35:20,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 00:35:20,634 INFO L425 stractBuchiCegarLoop]: Abstraction has 68 states and 76 transitions. [2024-11-08 00:35:20,634 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-08 00:35:20,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 76 transitions. [2024-11-08 00:35:20,635 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-08 00:35:20,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:35:20,635 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:35:20,648 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-08 00:35:20,648 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-08 00:35:20,648 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-08 00:35:20,650 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-08 00:35:20,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:35:20,651 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 12 times [2024-11-08 00:35:20,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:35:20,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003140283] [2024-11-08 00:35:20,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:35:20,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:35:20,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:35:20,666 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:35:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:35:20,678 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:35:20,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:35:20,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1559274986, now seen corresponding path program 8 times [2024-11-08 00:35:20,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:35:20,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164114657] [2024-11-08 00:35:20,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:35:20,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:35:21,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:25,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:25,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:29,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:30,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:30,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:30,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:31,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:31,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-08 00:35:31,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:31,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:31,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:31,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2