./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.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_4.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', '45898d4df949634911027a72c0e1c79e1edaab63547cca5c16238cef1218e556'] 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_4.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 45898d4df949634911027a72c0e1c79e1edaab63547cca5c16238cef1218e556 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-08 00:34:11,670 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 00:34:11,750 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:11,754 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 00:34:11,754 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 00:34:11,768 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 00:34:11,769 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 00:34:11,769 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 00:34:11,769 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 00:34:11,769 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 00:34:11,769 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 00:34:11,769 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 00:34:11,769 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 00:34:11,769 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-08 00:34:11,770 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-08 00:34:11,770 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-08 00:34:11,770 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-08 00:34:11,770 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-08 00:34:11,770 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-08 00:34:11,770 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 00:34:11,770 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-08 00:34:11,770 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 00:34:11,770 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 00:34:11,770 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 00:34:11,770 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 00:34:11,771 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-08 00:34:11,771 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-08 00:34:11,771 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-08 00:34:11,771 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 00:34:11,771 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 00:34:11,771 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 00:34:11,771 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 00:34:11,771 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-08 00:34:11,771 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 00:34:11,771 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 00:34:11,771 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 00:34:11,772 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 00:34:11,772 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 00:34:11,772 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-08 00:34:11,772 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 -> 45898d4df949634911027a72c0e1c79e1edaab63547cca5c16238cef1218e556 [2024-11-08 00:34:11,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 00:34:11,984 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 00:34:11,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 00:34:11,988 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 00:34:11,989 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 00:34:11,990 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_4.c [2024-11-08 00:34:13,153 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 00:34:13,397 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 00:34:13,397 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c [2024-11-08 00:34:13,404 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b76ab500/c6b468999a4e4f39940247c326327a57/FLAGfb2770438 [2024-11-08 00:34:13,420 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b76ab500/c6b468999a4e4f39940247c326327a57 [2024-11-08 00:34:13,422 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 00:34:13,423 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 00:34:13,425 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 00:34:13,425 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 00:34:13,428 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 00:34:13,429 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:34:13" (1/1) ... [2024-11-08 00:34:13,431 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79335cbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:34:13, skipping insertion in model container [2024-11-08 00:34:13,431 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:34:13" (1/1) ... [2024-11-08 00:34:13,441 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 00:34:13,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 00:34:13,543 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 00:34:13,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 00:34:13,567 INFO L204 MainTranslator]: Completed translation [2024-11-08 00:34:13,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:34:13 WrapperNode [2024-11-08 00:34:13,568 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 00:34:13,569 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 00:34:13,570 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 00:34:13,570 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 00:34:13,576 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:13" (1/1) ... [2024-11-08 00:34:13,580 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:13" (1/1) ... [2024-11-08 00:34:13,594 INFO L138 Inliner]: procedures = 15, calls = 52, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2024-11-08 00:34:13,595 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 00:34:13,595 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 00:34:13,595 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 00:34:13,596 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 00:34:13,601 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:13" (1/1) ... [2024-11-08 00:34:13,601 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:13" (1/1) ... [2024-11-08 00:34:13,607 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:13" (1/1) ... [2024-11-08 00:34:13,620 INFO L175 MemorySlicer]: Split 26 memory accesses to 5 slices as follows [2, 6, 6, 6, 6]. 23 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 1, 1, 1, 1]. The 8 writes are split as follows [0, 2, 2, 2, 2]. [2024-11-08 00:34:13,623 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:13" (1/1) ... [2024-11-08 00:34:13,623 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:13" (1/1) ... [2024-11-08 00:34:13,631 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:13" (1/1) ... [2024-11-08 00:34:13,632 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:13" (1/1) ... [2024-11-08 00:34:13,633 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:13" (1/1) ... [2024-11-08 00:34:13,633 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:13" (1/1) ... [2024-11-08 00:34:13,638 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 00:34:13,639 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 00:34:13,639 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 00:34:13,639 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 00:34:13,639 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:34:13" (1/1) ... [2024-11-08 00:34:13,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 00:34:13,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:34:13,665 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:13,671 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:13,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 00:34:13,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 00:34:13,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 00:34:13,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 00:34:13,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-08 00:34:13,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-08 00:34:13,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 00:34:13,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 00:34:13,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 00:34:13,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 00:34:13,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-08 00:34:13,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-08 00:34:13,689 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2024-11-08 00:34:13,689 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2024-11-08 00:34:13,689 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2024-11-08 00:34:13,689 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2024-11-08 00:34:13,689 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_22_to_23_0 [2024-11-08 00:34:13,689 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_22_to_23_0 [2024-11-08 00:34:13,690 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_25_0 [2024-11-08 00:34:13,690 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_25_0 [2024-11-08 00:34:13,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 00:34:13,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 00:34:13,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 00:34:13,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 00:34:13,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 00:34:13,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-08 00:34:13,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-08 00:34:13,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 00:34:13,774 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 00:34:13,775 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 00:34:13,901 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-08 00:34:13,901 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 00:34:13,907 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 00:34:13,907 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 00:34:13,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:34:13 BoogieIcfgContainer [2024-11-08 00:34:13,908 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 00:34:13,908 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-08 00:34:13,908 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-08 00:34:13,912 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-08 00:34:13,912 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-08 00:34:13,912 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.11 12:34:13" (1/3) ... [2024-11-08 00:34:13,913 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d7b232c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.11 12:34:13, skipping insertion in model container [2024-11-08 00:34:13,913 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-08 00:34:13,913 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:34:13" (2/3) ... [2024-11-08 00:34:13,913 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d7b232c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.11 12:34:13, skipping insertion in model container [2024-11-08 00:34:13,913 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-08 00:34:13,913 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:34:13" (3/3) ... [2024-11-08 00:34:13,914 INFO L332 chiAutomizerObserver]: Analyzing ICFG recursified_nested_4.c [2024-11-08 00:34:13,941 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-08 00:34:13,941 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-08 00:34:13,941 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-08 00:34:13,941 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-08 00:34:13,941 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-08 00:34:13,941 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-08 00:34:13,942 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-08 00:34:13,942 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-08 00:34:13,944 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 41 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 32 states have internal predecessors, (36), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 00:34:13,954 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-08 00:34:13,955 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:34:13,955 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:34:13,958 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-08 00:34:13,958 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 00:34:13,959 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-08 00:34:13,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 41 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 32 states have internal predecessors, (36), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 00:34:13,960 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-08 00:34:13,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:34:13,961 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:34:13,961 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-08 00:34:13,961 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 00:34:13,966 INFO L745 eck$LassoCheckResult]: Stem: 37#$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); 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(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 write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 29#L107true call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 33#$Ultimate##0true [2024-11-08 00:34:13,966 INFO L747 eck$LassoCheckResult]: Loop: 33#$Ultimate##0true ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#3(~a.base, ~a.offset, 4); 10#L81true assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~b.base, ~b.offset, 4); 21#L87true call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 20#$Ultimate##0true ~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~mem10 := read~int#2(~b.base, ~b.offset, 4); 24#L61true assume !(#t~mem10 < 6);havoc #t~mem10; 6#L61-1true assume true; 9#func_to_recursive_line_23_to_24_0EXITtrue >#88#return; 15#L87-1true call #t~mem14 := read~int#3(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 7#L92true call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 33#$Ultimate##0true [2024-11-08 00:34:13,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:13,969 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 1 times [2024-11-08 00:34:13,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:13,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093075658] [2024-11-08 00:34:13,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:13,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:14,095 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:34:14,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:14,144 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:34:14,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:14,149 INFO L85 PathProgramCache]: Analyzing trace with hash -448633028, now seen corresponding path program 1 times [2024-11-08 00:34:14,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:14,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312959817] [2024-11-08 00:34:14,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:14,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:14,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:14,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:14,423 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:14,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 00:34:14,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312959817] [2024-11-08 00:34:14,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312959817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 00:34:14,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 00:34:14,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 00:34:14,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34137884] [2024-11-08 00:34:14,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 00:34:14,427 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-08 00:34:14,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 00:34:14,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 00:34:14,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 00:34:14,446 INFO L87 Difference]: Start difference. First operand has 41 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 32 states have internal predecessors, (36), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 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:14,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 00:34:14,605 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2024-11-08 00:34:14,606 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 61 transitions. [2024-11-08 00:34:14,609 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-08 00:34:14,616 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 33 states and 41 transitions. [2024-11-08 00:34:14,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2024-11-08 00:34:14,617 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2024-11-08 00:34:14,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2024-11-08 00:34:14,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 00:34:14,618 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 41 transitions. [2024-11-08 00:34:14,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2024-11-08 00:34:14,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2024-11-08 00:34:14,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 20 states have internal predecessors, (20), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-08 00:34:14,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-11-08 00:34:14,636 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-11-08 00:34:14,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 00:34:14,639 INFO L425 stractBuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-11-08 00:34:14,640 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-08 00:34:14,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2024-11-08 00:34:14,641 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-08 00:34:14,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:34:14,642 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:34:14,643 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-08 00:34:14,643 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:14,643 INFO L745 eck$LassoCheckResult]: Stem: 136#$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); 124#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(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 write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 120#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 121#$Ultimate##0 [2024-11-08 00:34:14,643 INFO L747 eck$LassoCheckResult]: Loop: 121#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#3(~a.base, ~a.offset, 4); 123#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~b.base, ~b.offset, 4); 110#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 111#$Ultimate##0 ~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~mem10 := read~int#2(~b.base, ~b.offset, 4); 131#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~c.base, ~c.offset, 4); 113#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 125#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 112#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 116#L41-1 assume true; 132#func_to_recursive_line_24_to_25_0EXIT >#84#return; 134#L67-1 call #t~mem11 := read~int#2(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 109#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 111#$Ultimate##0 ~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~mem10 := read~int#2(~b.base, ~b.offset, 4); 131#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 117#L61-1 assume true; 118#func_to_recursive_line_23_to_24_0EXIT >#86#return; 122#L61-1 assume true; 137#func_to_recursive_line_23_to_24_0EXIT >#88#return; 128#L87-1 call #t~mem14 := read~int#3(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 119#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 121#$Ultimate##0 [2024-11-08 00:34:14,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:14,644 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 2 times [2024-11-08 00:34:14,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:14,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031189527] [2024-11-08 00:34:14,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:14,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:14,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:14,663 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:34:14,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:14,675 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:34:14,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:14,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1860565822, now seen corresponding path program 1 times [2024-11-08 00:34:14,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:14,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693036531] [2024-11-08 00:34:14,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:14,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:14,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:14,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:14,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:14,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:14,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 00:34:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:14,985 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:14,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 00:34:14,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693036531] [2024-11-08 00:34:14,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693036531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 00:34:14,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 00:34:14,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 00:34:14,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510552159] [2024-11-08 00:34:14,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 00:34:14,986 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-08 00:34:14,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 00:34:14,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 00:34:14,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 00:34:14,989 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. cyclomatic complexity: 10 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:15,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 00:34:15,114 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2024-11-08 00:34:15,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 40 transitions. [2024-11-08 00:34:15,116 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-08 00:34:15,118 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 40 transitions. [2024-11-08 00:34:15,118 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2024-11-08 00:34:15,119 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2024-11-08 00:34:15,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 40 transitions. [2024-11-08 00:34:15,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 00:34:15,120 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 40 transitions. [2024-11-08 00:34:15,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 40 transitions. [2024-11-08 00:34:15,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2024-11-08 00:34:15,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 21 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-08 00:34:15,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-11-08 00:34:15,122 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-11-08 00:34:15,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 00:34:15,123 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-11-08 00:34:15,123 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-08 00:34:15,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2024-11-08 00:34:15,124 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-08 00:34:15,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:34:15,124 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:34:15,125 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-08 00:34:15,125 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:15,125 INFO L745 eck$LassoCheckResult]: Stem: 237#$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); 223#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(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 write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 219#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 220#$Ultimate##0 [2024-11-08 00:34:15,125 INFO L747 eck$LassoCheckResult]: Loop: 220#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#3(~a.base, ~a.offset, 4); 222#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~b.base, ~b.offset, 4); 209#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 210#$Ultimate##0 ~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~mem10 := read~int#2(~b.base, ~b.offset, 4); 230#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~c.base, ~c.offset, 4); 212#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 224#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 211#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 214#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 226#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 235#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 228#L25-1 assume true; 229#func_to_recursive_line_25_to_25_0EXIT >#80#return; 233#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 213#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 224#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 211#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 215#L41-1 assume true; 236#func_to_recursive_line_24_to_25_0EXIT >#82#return; 231#L41-1 assume true; 232#func_to_recursive_line_24_to_25_0EXIT >#84#return; 234#L67-1 call #t~mem11 := read~int#2(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 208#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 210#$Ultimate##0 ~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~mem10 := read~int#2(~b.base, ~b.offset, 4); 230#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 216#L61-1 assume true; 217#func_to_recursive_line_23_to_24_0EXIT >#86#return; 221#L61-1 assume true; 238#func_to_recursive_line_23_to_24_0EXIT >#88#return; 227#L87-1 call #t~mem14 := read~int#3(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 218#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 220#$Ultimate##0 [2024-11-08 00:34:15,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:15,125 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 3 times [2024-11-08 00:34:15,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:15,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236318913] [2024-11-08 00:34:15,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:15,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:15,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:15,141 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:34:15,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:15,151 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:34:15,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:15,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1780666575, now seen corresponding path program 1 times [2024-11-08 00:34:15,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:15,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145530678] [2024-11-08 00:34:15,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:15,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:15,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:15,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:15,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:15,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:15,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:15,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:15,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 00:34:15,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:15,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 00:34:15,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:15,524 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:15,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 00:34:15,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145530678] [2024-11-08 00:34:15,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145530678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 00:34:15,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 00:34:15,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 00:34:15,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573938991] [2024-11-08 00:34:15,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 00:34:15,524 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-08 00:34:15,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 00:34:15,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 00:34:15,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-08 00:34:15,525 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 10 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:15,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 00:34:15,626 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2024-11-08 00:34:15,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 39 transitions. [2024-11-08 00:34:15,627 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-08 00:34:15,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 39 transitions. [2024-11-08 00:34:15,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2024-11-08 00:34:15,630 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2024-11-08 00:34:15,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 39 transitions. [2024-11-08 00:34:15,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 00:34:15,631 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-11-08 00:34:15,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 39 transitions. [2024-11-08 00:34:15,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-08 00:34:15,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 22 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-08 00:34:15,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2024-11-08 00:34:15,634 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-11-08 00:34:15,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 00:34:15,635 INFO L425 stractBuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-11-08 00:34:15,636 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-08 00:34:15,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 39 transitions. [2024-11-08 00:34:15,637 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-08 00:34:15,637 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:34:15,638 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:34:15,638 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-08 00:34:15,639 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] [2024-11-08 00:34:15,639 INFO L745 eck$LassoCheckResult]: Stem: 369#$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); 355#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(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 write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 351#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 352#$Ultimate##0 [2024-11-08 00:34:15,639 INFO L747 eck$LassoCheckResult]: Loop: 352#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#3(~a.base, ~a.offset, 4); 354#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~b.base, ~b.offset, 4); 341#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 342#$Ultimate##0 ~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~mem10 := read~int#2(~b.base, ~b.offset, 4); 362#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~c.base, ~c.offset, 4); 344#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 356#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 343#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 346#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 358#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 367#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 357#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 358#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 367#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 360#L25-1 assume true; 361#func_to_recursive_line_25_to_25_0EXIT >#92#return; 364#L25-1 assume true; 370#func_to_recursive_line_25_to_25_0EXIT >#80#return; 365#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 345#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 356#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 343#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 347#L41-1 assume true; 363#func_to_recursive_line_24_to_25_0EXIT >#82#return; 368#L41-1 assume true; 372#func_to_recursive_line_24_to_25_0EXIT >#84#return; 366#L67-1 call #t~mem11 := read~int#2(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 340#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 342#$Ultimate##0 ~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~mem10 := read~int#2(~b.base, ~b.offset, 4); 362#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 348#L61-1 assume true; 349#func_to_recursive_line_23_to_24_0EXIT >#86#return; 353#L61-1 assume true; 371#func_to_recursive_line_23_to_24_0EXIT >#88#return; 359#L87-1 call #t~mem14 := read~int#3(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 350#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 352#$Ultimate##0 [2024-11-08 00:34:15,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:15,640 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 4 times [2024-11-08 00:34:15,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:15,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71035946] [2024-11-08 00:34:15,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:15,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:15,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:15,650 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:34:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:15,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:34:15,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:15,663 INFO L85 PathProgramCache]: Analyzing trace with hash -971158242, now seen corresponding path program 1 times [2024-11-08 00:34:15,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:15,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103577965] [2024-11-08 00:34:15,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:15,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:15,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:15,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:15,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:15,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:16,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:16,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:16,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-08 00:34:16,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:16,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 00:34:16,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:16,152 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 00:34:16,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 00:34:16,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103577965] [2024-11-08 00:34:16,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103577965] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 00:34:16,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905242183] [2024-11-08 00:34:16,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:16,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 00:34:16,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:34:16,155 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:16,156 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:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:16,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-08 00:34:16,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:34:16,262 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:16,384 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 00:34:16,385 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 00:34:16,955 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 00:34:16,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905242183] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 00:34:16,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 00:34:16,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 23 [2024-11-08 00:34:16,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428435270] [2024-11-08 00:34:16,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 00:34:16,956 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-08 00:34:16,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 00:34:16,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-08 00:34:16,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2024-11-08 00:34:16,957 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. cyclomatic complexity: 10 Second operand has 23 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 states have internal predecessors, (39), 7 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (12), 4 states have call predecessors, (12), 7 states have call successors, (12) [2024-11-08 00:34:17,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 00:34:17,295 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2024-11-08 00:34:17,295 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 43 transitions. [2024-11-08 00:34:17,296 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-08 00:34:17,297 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 43 transitions. [2024-11-08 00:34:17,297 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2024-11-08 00:34:17,298 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2024-11-08 00:34:17,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 43 transitions. [2024-11-08 00:34:17,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 00:34:17,298 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-11-08 00:34:17,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 43 transitions. [2024-11-08 00:34:17,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-08 00:34:17,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 24 states have internal predecessors, (24), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2024-11-08 00:34:17,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2024-11-08 00:34:17,302 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-11-08 00:34:17,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 00:34:17,308 INFO L425 stractBuchiCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-11-08 00:34:17,308 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-08 00:34:17,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 43 transitions. [2024-11-08 00:34:17,308 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-08 00:34:17,310 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:34:17,310 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:34:17,311 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-08 00:34:17,311 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 3, 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:17,311 INFO L745 eck$LassoCheckResult]: Stem: 756#$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); 743#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(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 write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 739#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 740#$Ultimate##0 [2024-11-08 00:34:17,311 INFO L747 eck$LassoCheckResult]: Loop: 740#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#3(~a.base, ~a.offset, 4); 742#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~b.base, ~b.offset, 4); 729#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 730#$Ultimate##0 ~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~mem10 := read~int#2(~b.base, ~b.offset, 4); 750#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~c.base, ~c.offset, 4); 732#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 744#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 731#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 734#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 747#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 757#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 746#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 747#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 757#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 746#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 747#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 757#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 746#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 747#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 757#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 748#L25-1 assume true; 749#func_to_recursive_line_25_to_25_0EXIT >#92#return; 752#L25-1 assume true; 763#func_to_recursive_line_25_to_25_0EXIT >#92#return; 762#L25-1 assume true; 761#func_to_recursive_line_25_to_25_0EXIT >#92#return; 760#L25-1 assume true; 759#func_to_recursive_line_25_to_25_0EXIT >#80#return; 753#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 733#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 744#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 731#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 735#L41-1 assume true; 751#func_to_recursive_line_24_to_25_0EXIT >#82#return; 755#L41-1 assume true; 764#func_to_recursive_line_24_to_25_0EXIT >#84#return; 754#L67-1 call #t~mem11 := read~int#2(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 728#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 730#$Ultimate##0 ~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~mem10 := read~int#2(~b.base, ~b.offset, 4); 750#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 736#L61-1 assume true; 737#func_to_recursive_line_23_to_24_0EXIT >#86#return; 741#L61-1 assume true; 758#func_to_recursive_line_23_to_24_0EXIT >#88#return; 745#L87-1 call #t~mem14 := read~int#3(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 738#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 740#$Ultimate##0 [2024-11-08 00:34:17,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:17,311 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 5 times [2024-11-08 00:34:17,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:17,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654941296] [2024-11-08 00:34:17,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:17,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:17,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:17,322 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:34:17,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:17,329 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:34:17,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:17,330 INFO L85 PathProgramCache]: Analyzing trace with hash -2092880572, now seen corresponding path program 2 times [2024-11-08 00:34:17,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:17,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507201932] [2024-11-08 00:34:17,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:17,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:17,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:17,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:17,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:18,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:18,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:18,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:18,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:18,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:18,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:18,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:18,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 00:34:18,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:18,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 00:34:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:18,437 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 00:34:18,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 00:34:18,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507201932] [2024-11-08 00:34:18,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507201932] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 00:34:18,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971999595] [2024-11-08 00:34:18,437 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 00:34:18,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 00:34:18,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:34:18,439 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:18,441 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:18,535 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 00:34:18,535 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 00:34:18,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-08 00:34:18,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:34:18,543 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:18,771 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 00:34:18,771 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 00:34:20,010 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 00:34:20,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971999595] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 00:34:20,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 00:34:20,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 18] total 35 [2024-11-08 00:34:20,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000945736] [2024-11-08 00:34:20,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 00:34:20,011 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-08 00:34:20,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 00:34:20,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-08 00:34:20,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=956, Unknown=0, NotChecked=0, Total=1190 [2024-11-08 00:34:20,012 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. cyclomatic complexity: 10 Second operand has 35 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 28 states have internal predecessors, (49), 10 states have call successors, (19), 9 states have call predecessors, (19), 11 states have return successors, (18), 8 states have call predecessors, (18), 10 states have call successors, (18) [2024-11-08 00:34:20,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 00:34:20,457 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2024-11-08 00:34:20,457 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 47 transitions. [2024-11-08 00:34:20,457 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-08 00:34:20,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 47 transitions. [2024-11-08 00:34:20,458 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2024-11-08 00:34:20,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2024-11-08 00:34:20,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 47 transitions. [2024-11-08 00:34:20,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 00:34:20,459 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-11-08 00:34:20,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 47 transitions. [2024-11-08 00:34:20,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-08 00:34:20,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 26 states have internal predecessors, (26), 8 states have call successors, (8), 4 states have call predecessors, (8), 10 states have return successors, (13), 10 states have call predecessors, (13), 6 states have call successors, (13) [2024-11-08 00:34:20,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2024-11-08 00:34:20,463 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-11-08 00:34:20,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 00:34:20,464 INFO L425 stractBuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-11-08 00:34:20,465 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-08 00:34:20,465 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 47 transitions. [2024-11-08 00:34:20,466 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-08 00:34:20,469 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:34:20,469 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:34:20,470 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-08 00:34:20,470 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 5, 5, 5, 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:20,470 INFO L745 eck$LassoCheckResult]: Stem: 1282#$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); 1268#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(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 write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 1264#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 1265#$Ultimate##0 [2024-11-08 00:34:20,470 INFO L747 eck$LassoCheckResult]: Loop: 1265#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#3(~a.base, ~a.offset, 4); 1267#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~b.base, ~b.offset, 4); 1254#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1255#$Ultimate##0 ~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~mem10 := read~int#2(~b.base, ~b.offset, 4); 1275#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~c.base, ~c.offset, 4); 1258#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 1269#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 1256#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 1259#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1271#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 1281#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1270#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1271#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 1281#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1270#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1271#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 1281#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1270#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1271#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 1281#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1270#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1271#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 1281#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1270#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1271#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 1281#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1273#L25-1 assume true; 1274#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1277#L25-1 assume true; 1293#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1292#L25-1 assume true; 1291#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1290#L25-1 assume true; 1289#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1287#L25-1 assume true; 1286#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1284#L25-1 assume true; 1283#func_to_recursive_line_25_to_25_0EXIT >#80#return; 1278#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 1257#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 1269#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 1256#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1260#L41-1 assume true; 1276#func_to_recursive_line_24_to_25_0EXIT >#82#return; 1280#L41-1 assume true; 1288#func_to_recursive_line_24_to_25_0EXIT >#84#return; 1279#L67-1 call #t~mem11 := read~int#2(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 1253#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1255#$Ultimate##0 ~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~mem10 := read~int#2(~b.base, ~b.offset, 4); 1275#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1261#L61-1 assume true; 1262#func_to_recursive_line_23_to_24_0EXIT >#86#return; 1266#L61-1 assume true; 1285#func_to_recursive_line_23_to_24_0EXIT >#88#return; 1272#L87-1 call #t~mem14 := read~int#3(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 1263#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 1265#$Ultimate##0 [2024-11-08 00:34:20,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:20,471 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 6 times [2024-11-08 00:34:20,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:20,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876353888] [2024-11-08 00:34:20,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:20,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:20,481 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:34:20,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:20,488 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:34:20,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:20,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1778629226, now seen corresponding path program 3 times [2024-11-08 00:34:20,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:20,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310711905] [2024-11-08 00:34:20,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:20,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:20,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:20,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:21,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:21,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:21,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:21,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:21,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:22,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:22,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:22,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:22,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:22,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:22,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:22,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 00:34:22,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:22,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 00:34:22,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:22,249 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 35 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-08 00:34:22,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 00:34:22,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310711905] [2024-11-08 00:34:22,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310711905] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 00:34:22,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726732232] [2024-11-08 00:34:22,249 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 00:34:22,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 00:34:22,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:34:22,254 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:22,255 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:22,335 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-08 00:34:22,335 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 00:34:22,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-08 00:34:22,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:34:22,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 00:34:22,491 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-08 00:34:22,491 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 00:34:22,853 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-08 00:34:22,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726732232] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 00:34:22,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 00:34:22,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 9, 10] total 32 [2024-11-08 00:34:22,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754548033] [2024-11-08 00:34:22,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 00:34:22,855 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-08 00:34:22,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 00:34:22,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-08 00:34:22,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=868, Unknown=0, NotChecked=0, Total=992 [2024-11-08 00:34:22,856 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. cyclomatic complexity: 10 Second operand has 32 states, 25 states have (on average 2.0) internal successors, (50), 26 states have internal predecessors, (50), 11 states have call successors, (17), 8 states have call predecessors, (17), 12 states have return successors, (19), 11 states have call predecessors, (19), 11 states have call successors, (19) [2024-11-08 00:34:23,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 00:34:23,422 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2024-11-08 00:34:23,422 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 51 transitions. [2024-11-08 00:34:23,423 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-08 00:34:23,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 51 transitions. [2024-11-08 00:34:23,424 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2024-11-08 00:34:23,424 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2024-11-08 00:34:23,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 51 transitions. [2024-11-08 00:34:23,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 00:34:23,424 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 51 transitions. [2024-11-08 00:34:23,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 51 transitions. [2024-11-08 00:34:23,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-08 00:34:23,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 25 states have (on average 1.12) internal successors, (28), 28 states have internal predecessors, (28), 8 states have call successors, (8), 4 states have call predecessors, (8), 12 states have return successors, (15), 12 states have call predecessors, (15), 6 states have call successors, (15) [2024-11-08 00:34:23,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2024-11-08 00:34:23,430 INFO L240 hiAutomatonCegarLoop]: Abstraction has 45 states and 51 transitions. [2024-11-08 00:34:23,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 00:34:23,431 INFO L425 stractBuchiCegarLoop]: Abstraction has 45 states and 51 transitions. [2024-11-08 00:34:23,431 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-08 00:34:23,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 51 transitions. [2024-11-08 00:34:23,431 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-08 00:34:23,431 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:34:23,431 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:34:23,433 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-08 00:34:23,433 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [14, 14, 12, 12, 12, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 00:34:23,433 INFO L745 eck$LassoCheckResult]: Stem: 1958#$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); 1946#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(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 write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 1942#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 1943#$Ultimate##0 [2024-11-08 00:34:23,433 INFO L747 eck$LassoCheckResult]: Loop: 1943#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#3(~a.base, ~a.offset, 4); 1945#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~b.base, ~b.offset, 4); 1932#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1933#$Ultimate##0 ~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~mem10 := read~int#2(~b.base, ~b.offset, 4); 1953#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~c.base, ~c.offset, 4); 1936#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 1947#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 1934#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 1937#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1950#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 1960#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1950#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 1960#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1950#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 1960#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1950#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 1960#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1950#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 1960#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1950#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 1960#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1950#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 1960#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1951#L25-1 assume true; 1952#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1955#L25-1 assume true; 1975#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1974#L25-1 assume true; 1973#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1971#L25-1 assume true; 1970#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1969#L25-1 assume true; 1968#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1967#L25-1 assume true; 1966#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1964#L25-1 assume true; 1963#func_to_recursive_line_25_to_25_0EXIT >#80#return; 1956#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 1935#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 1947#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 1934#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1938#L41-1 assume true; 1954#func_to_recursive_line_24_to_25_0EXIT >#82#return; 1959#L41-1 assume true; 1972#func_to_recursive_line_24_to_25_0EXIT >#84#return; 1957#L67-1 call #t~mem11 := read~int#2(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 1931#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1933#$Ultimate##0 ~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~mem10 := read~int#2(~b.base, ~b.offset, 4); 1953#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~c.base, ~c.offset, 4); 1936#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 1947#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 1934#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 1937#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1950#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 1960#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1950#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 1960#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1950#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 1960#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1950#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 1960#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1950#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 1960#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1950#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 1960#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1950#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 1960#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1951#L25-1 assume true; 1952#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1955#L25-1 assume true; 1975#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1974#L25-1 assume true; 1973#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1971#L25-1 assume true; 1970#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1969#L25-1 assume true; 1968#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1967#L25-1 assume true; 1966#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1964#L25-1 assume true; 1963#func_to_recursive_line_25_to_25_0EXIT >#80#return; 1956#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 1935#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 1947#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 1934#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1938#L41-1 assume true; 1954#func_to_recursive_line_24_to_25_0EXIT >#82#return; 1959#L41-1 assume true; 1972#func_to_recursive_line_24_to_25_0EXIT >#84#return; 1957#L67-1 call #t~mem11 := read~int#2(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 1931#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1933#$Ultimate##0 ~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~mem10 := read~int#2(~b.base, ~b.offset, 4); 1953#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1939#L61-1 assume true; 1940#func_to_recursive_line_23_to_24_0EXIT >#86#return; 1944#L61-1 assume true; 1965#func_to_recursive_line_23_to_24_0EXIT >#86#return; 1962#L61-1 assume true; 1961#func_to_recursive_line_23_to_24_0EXIT >#88#return; 1948#L87-1 call #t~mem14 := read~int#3(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 1941#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 1943#$Ultimate##0 [2024-11-08 00:34:23,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:23,436 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 7 times [2024-11-08 00:34:23,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:23,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26727698] [2024-11-08 00:34:23,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:23,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:23,445 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:34:23,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:23,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:34:23,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:23,452 INFO L85 PathProgramCache]: Analyzing trace with hash -348181174, now seen corresponding path program 4 times [2024-11-08 00:34:23,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:23,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253604344] [2024-11-08 00:34:23,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:23,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:23,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:23,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:23,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:24,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:24,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:24,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:24,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:24,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:24,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:24,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:24,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:24,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:24,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:24,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:24,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:24,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:24,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:34:24,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:24,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 00:34:24,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:24,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:24,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:24,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:24,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:24,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:24,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:24,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:24,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:24,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:24,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:24,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:24,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:24,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:24,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:34:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:24,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 00:34:24,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:24,295 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2024-11-08 00:34:24,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 00:34:24,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253604344] [2024-11-08 00:34:24,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253604344] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 00:34:24,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868335688] [2024-11-08 00:34:24,296 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-08 00:34:24,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 00:34:24,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:34:24,302 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:24,321 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:24,477 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-08 00:34:24,477 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 00:34:24,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-08 00:34:24,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:34:24,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 00:34:24,700 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2024-11-08 00:34:24,701 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 00:34:25,398 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 457 trivial. 0 not checked. [2024-11-08 00:34:25,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868335688] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 00:34:25,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 00:34:25,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 14] total 32 [2024-11-08 00:34:25,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537361959] [2024-11-08 00:34:25,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 00:34:25,399 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-08 00:34:25,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 00:34:25,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-08 00:34:25,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=853, Unknown=0, NotChecked=0, Total=992 [2024-11-08 00:34:25,400 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. cyclomatic complexity: 10 Second operand has 32 states, 25 states have (on average 2.0) internal successors, (50), 25 states have internal predecessors, (50), 13 states have call successors, (22), 9 states have call predecessors, (22), 10 states have return successors, (19), 11 states have call predecessors, (19), 13 states have call successors, (19) [2024-11-08 00:34:25,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 00:34:25,803 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2024-11-08 00:34:25,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 55 transitions. [2024-11-08 00:34:25,804 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-08 00:34:25,805 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 55 transitions. [2024-11-08 00:34:25,805 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2024-11-08 00:34:25,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2024-11-08 00:34:25,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 55 transitions. [2024-11-08 00:34:25,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 00:34:25,805 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 55 transitions. [2024-11-08 00:34:25,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 55 transitions. [2024-11-08 00:34:25,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-08 00:34:25,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 30 states have internal predecessors, (30), 8 states have call successors, (8), 4 states have call predecessors, (8), 14 states have return successors, (17), 14 states have call predecessors, (17), 6 states have call successors, (17) [2024-11-08 00:34:25,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2024-11-08 00:34:25,810 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 55 transitions. [2024-11-08 00:34:25,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 00:34:25,811 INFO L425 stractBuchiCegarLoop]: Abstraction has 49 states and 55 transitions. [2024-11-08 00:34:25,811 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-08 00:34:25,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 55 transitions. [2024-11-08 00:34:25,812 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-08 00:34:25,812 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:34:25,812 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:34:25,815 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-08 00:34:25,815 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [42, 42, 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:34:25,815 INFO L745 eck$LassoCheckResult]: Stem: 3313#$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); 3299#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(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 write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 3295#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 3296#$Ultimate##0 [2024-11-08 00:34:25,819 INFO L747 eck$LassoCheckResult]: Loop: 3296#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#3(~a.base, ~a.offset, 4); 3298#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~b.base, ~b.offset, 4); 3285#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3286#$Ultimate##0 ~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~mem10 := read~int#2(~b.base, ~b.offset, 4); 3306#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~c.base, ~c.offset, 4); 3288#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 3300#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 3287#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 3290#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3302#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 3315#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3301#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3302#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 3315#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3301#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3302#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 3315#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3301#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3302#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 3315#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3301#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3302#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 3315#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3301#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3302#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 3315#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3301#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3302#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 3315#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3304#L25-1 assume true; 3305#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3310#L25-1 assume true; 3332#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3331#L25-1 assume true; 3330#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3329#L25-1 assume true; 3326#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3325#L25-1 assume true; 3324#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3322#L25-1 assume true; 3320#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3317#L25-1 assume true; 3316#func_to_recursive_line_25_to_25_0EXIT >#80#return; 3311#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 3289#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 3300#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 3287#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 3290#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3302#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 3315#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3301#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3302#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 3315#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3301#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3302#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 3315#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3301#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3302#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 3315#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3301#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3302#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 3315#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3301#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3302#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 3315#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3301#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3302#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 3315#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3304#L25-1 assume true; 3305#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3310#L25-1 assume true; 3332#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3331#L25-1 assume true; 3330#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3329#L25-1 assume true; 3326#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3325#L25-1 assume true; 3324#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3322#L25-1 assume true; 3320#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3317#L25-1 assume true; 3316#func_to_recursive_line_25_to_25_0EXIT >#80#return; 3311#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 3289#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 3300#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 3287#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3291#L41-1 assume true; 3314#func_to_recursive_line_24_to_25_0EXIT >#82#return; 3307#L41-1 assume true; 3308#func_to_recursive_line_24_to_25_0EXIT >#82#return; 3328#L41-1 assume true; 3327#func_to_recursive_line_24_to_25_0EXIT >#84#return; 3312#L67-1 call #t~mem11 := read~int#2(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 3284#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3286#$Ultimate##0 ~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~mem10 := read~int#2(~b.base, ~b.offset, 4); 3306#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~c.base, ~c.offset, 4); 3288#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 3300#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 3287#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 3290#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3302#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 3315#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3301#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3302#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 3315#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3301#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3302#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 3315#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3301#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3302#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 3315#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3301#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3302#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 3315#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3301#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3302#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 3315#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3301#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3302#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 3315#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3304#L25-1 assume true; 3305#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3310#L25-1 assume true; 3332#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3331#L25-1 assume true; 3330#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3329#L25-1 assume true; 3326#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3325#L25-1 assume true; 3324#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3322#L25-1 assume true; 3320#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3317#L25-1 assume true; 3316#func_to_recursive_line_25_to_25_0EXIT >#80#return; 3311#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 3289#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 3300#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 3287#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 3290#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3302#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 3315#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3301#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3302#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 3315#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3301#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3302#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 3315#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3301#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3302#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 3315#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3301#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3302#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 3315#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3301#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3302#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 3315#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3301#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3302#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 3315#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3304#L25-1 assume true; 3305#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3310#L25-1 assume true; 3332#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3331#L25-1 assume true; 3330#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3329#L25-1 assume true; 3326#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3325#L25-1 assume true; 3324#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3322#L25-1 assume true; 3320#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3317#L25-1 assume true; 3316#func_to_recursive_line_25_to_25_0EXIT >#80#return; 3311#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 3289#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 3300#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 3287#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3291#L41-1 assume true; 3314#func_to_recursive_line_24_to_25_0EXIT >#82#return; 3307#L41-1 assume true; 3308#func_to_recursive_line_24_to_25_0EXIT >#82#return; 3328#L41-1 assume true; 3327#func_to_recursive_line_24_to_25_0EXIT >#84#return; 3312#L67-1 call #t~mem11 := read~int#2(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 3284#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3286#$Ultimate##0 ~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~mem10 := read~int#2(~b.base, ~b.offset, 4); 3306#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~c.base, ~c.offset, 4); 3288#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 3300#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 3287#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 3290#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3302#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 3315#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3301#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3302#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 3315#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3301#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3302#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 3315#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3301#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3302#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 3315#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3301#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3302#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 3315#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3301#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3302#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 3315#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3301#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3302#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 3315#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3304#L25-1 assume true; 3305#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3310#L25-1 assume true; 3332#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3331#L25-1 assume true; 3330#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3329#L25-1 assume true; 3326#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3325#L25-1 assume true; 3324#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3322#L25-1 assume true; 3320#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3317#L25-1 assume true; 3316#func_to_recursive_line_25_to_25_0EXIT >#80#return; 3311#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 3289#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 3300#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 3287#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 3290#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3302#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 3315#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3301#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3302#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 3315#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3301#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3302#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 3315#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3301#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3302#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 3315#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3301#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3302#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 3315#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3301#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3302#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 3315#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3301#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3302#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 3315#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3304#L25-1 assume true; 3305#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3310#L25-1 assume true; 3332#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3331#L25-1 assume true; 3330#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3329#L25-1 assume true; 3326#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3325#L25-1 assume true; 3324#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3322#L25-1 assume true; 3320#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3317#L25-1 assume true; 3316#func_to_recursive_line_25_to_25_0EXIT >#80#return; 3311#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 3289#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 3300#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 3287#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3291#L41-1 assume true; 3314#func_to_recursive_line_24_to_25_0EXIT >#82#return; 3307#L41-1 assume true; 3308#func_to_recursive_line_24_to_25_0EXIT >#82#return; 3328#L41-1 assume true; 3327#func_to_recursive_line_24_to_25_0EXIT >#84#return; 3312#L67-1 call #t~mem11 := read~int#2(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 3284#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3286#$Ultimate##0 ~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~mem10 := read~int#2(~b.base, ~b.offset, 4); 3306#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 3309#L61-1 assume true; 3297#func_to_recursive_line_23_to_24_0EXIT >#86#return; 3292#L61-1 assume true; 3293#func_to_recursive_line_23_to_24_0EXIT >#86#return; 3323#L61-1 assume true; 3321#func_to_recursive_line_23_to_24_0EXIT >#86#return; 3319#L61-1 assume true; 3318#func_to_recursive_line_23_to_24_0EXIT >#88#return; 3303#L87-1 call #t~mem14 := read~int#3(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 3294#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 3296#$Ultimate##0 [2024-11-08 00:34:25,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:25,820 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 8 times [2024-11-08 00:34:25,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:25,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475333175] [2024-11-08 00:34:25,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:25,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:25,829 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:34:25,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:25,836 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:34:25,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:25,837 INFO L85 PathProgramCache]: Analyzing trace with hash 732034000, now seen corresponding path program 5 times [2024-11-08 00:34:25,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:25,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471760424] [2024-11-08 00:34:25,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:25,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:26,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:27,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:27,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:27,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:27,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:27,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:27,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:27,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:27,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:27,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:27,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:27,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:27,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:27,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:27,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:27,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:34:27,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:27,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:27,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:27,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:27,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:27,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:27,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:27,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:28,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:28,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:28,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:28,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:28,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:28,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:28,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:34:28,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:28,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 00:34:28,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:28,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:28,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:28,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:28,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:28,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:28,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:28,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:28,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:28,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:28,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:28,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:28,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:28,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:28,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:28,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:34:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:28,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:28,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:28,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:28,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:28,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:28,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:28,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:28,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:28,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:28,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:28,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:28,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:28,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:28,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:34:28,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:28,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 00:34:28,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:28,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:28,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:28,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:28,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:28,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:28,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:28,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:28,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:28,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:28,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:28,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:28,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:28,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:28,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:28,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:28,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:34:28,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:28,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:28,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:28,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:28,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:28,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:28,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:28,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:28,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:28,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:28,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:28,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:28,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:34:28,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:28,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 00:34:28,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:28,359 INFO L134 CoverageAnalysis]: Checked inductivity of 4296 backedges. 6 proven. 95 refuted. 0 times theorem prover too weak. 4195 trivial. 0 not checked. [2024-11-08 00:34:28,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 00:34:28,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471760424] [2024-11-08 00:34:28,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471760424] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 00:34:28,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871437214] [2024-11-08 00:34:28,363 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-08 00:34:28,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 00:34:28,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:34:28,368 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:28,369 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:31,181 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2024-11-08 00:34:31,182 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 00:34:31,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 1526 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-08 00:34:31,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:34:31,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 00:34:31,351 INFO L134 CoverageAnalysis]: Checked inductivity of 4296 backedges. 2015 proven. 8 refuted. 0 times theorem prover too weak. 2273 trivial. 0 not checked. [2024-11-08 00:34:31,351 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 00:34:32,617 INFO L134 CoverageAnalysis]: Checked inductivity of 4296 backedges. 59 proven. 66 refuted. 0 times theorem prover too weak. 4171 trivial. 0 not checked. [2024-11-08 00:34:32,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871437214] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 00:34:32,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 00:34:32,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 14] total 31 [2024-11-08 00:34:32,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874969190] [2024-11-08 00:34:32,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 00:34:32,618 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-08 00:34:32,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 00:34:32,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-08 00:34:32,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=760, Unknown=0, NotChecked=0, Total=930 [2024-11-08 00:34:32,619 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. cyclomatic complexity: 10 Second operand has 31 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 13 states have call successors, (33), 9 states have call predecessors, (33), 8 states have return successors, (26), 10 states have call predecessors, (26), 13 states have call successors, (26) [2024-11-08 00:34:32,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 00:34:32,858 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2024-11-08 00:34:32,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 57 transitions. [2024-11-08 00:34:32,858 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-08 00:34:32,859 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 57 transitions. [2024-11-08 00:34:32,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2024-11-08 00:34:32,859 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2024-11-08 00:34:32,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 57 transitions. [2024-11-08 00:34:32,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 00:34:32,860 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 57 transitions. [2024-11-08 00:34:32,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 57 transitions. [2024-11-08 00:34:32,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-08 00:34:32,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 31 states have internal predecessors, (31), 8 states have call successors, (8), 4 states have call predecessors, (8), 15 states have return successors, (18), 15 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-08 00:34:32,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2024-11-08 00:34:32,862 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 57 transitions. [2024-11-08 00:34:32,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 00:34:32,863 INFO L425 stractBuchiCegarLoop]: Abstraction has 51 states and 57 transitions. [2024-11-08 00:34:32,863 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-08 00:34:32,863 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 57 transitions. [2024-11-08 00:34:32,864 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-08 00:34:32,864 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:34:32,864 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:34:32,866 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-08 00:34:32,867 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [63, 63, 54, 54, 54, 12, 12, 9, 9, 9, 9, 9, 9, 9, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 00:34:32,867 INFO L745 eck$LassoCheckResult]: Stem: 6956#$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); 6942#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(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 write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 6938#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 6939#$Ultimate##0 [2024-11-08 00:34:32,867 INFO L747 eck$LassoCheckResult]: Loop: 6939#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#3(~a.base, ~a.offset, 4); 6941#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~b.base, ~b.offset, 4); 6928#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 6929#$Ultimate##0 ~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~mem10 := read~int#2(~b.base, ~b.offset, 4); 6949#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~c.base, ~c.offset, 4); 6932#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 6943#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 6930#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 6933#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6958#L25-1 assume true; 6952#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6947#L25-1 assume true; 6948#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6974#L25-1 assume true; 6971#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6970#L25-1 assume true; 6969#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6968#L25-1 assume true; 6967#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6966#L25-1 assume true; 6964#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6962#L25-1 assume true; 6961#func_to_recursive_line_25_to_25_0EXIT >#80#return; 6953#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 6931#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 6943#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 6930#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 6933#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6958#L25-1 assume true; 6952#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6947#L25-1 assume true; 6948#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6974#L25-1 assume true; 6971#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6970#L25-1 assume true; 6969#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6968#L25-1 assume true; 6967#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6966#L25-1 assume true; 6964#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6962#L25-1 assume true; 6961#func_to_recursive_line_25_to_25_0EXIT >#80#return; 6953#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 6931#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 6943#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 6930#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 6933#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6958#L25-1 assume true; 6952#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6947#L25-1 assume true; 6948#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6974#L25-1 assume true; 6971#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6970#L25-1 assume true; 6969#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6968#L25-1 assume true; 6967#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6966#L25-1 assume true; 6964#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6962#L25-1 assume true; 6961#func_to_recursive_line_25_to_25_0EXIT >#80#return; 6953#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 6931#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 6943#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 6930#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6934#L41-1 assume true; 6950#func_to_recursive_line_24_to_25_0EXIT >#82#return; 6955#L41-1 assume true; 6977#func_to_recursive_line_24_to_25_0EXIT >#82#return; 6976#L41-1 assume true; 6975#func_to_recursive_line_24_to_25_0EXIT >#82#return; 6973#L41-1 assume true; 6972#func_to_recursive_line_24_to_25_0EXIT >#84#return; 6954#L67-1 call #t~mem11 := read~int#2(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 6927#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 6929#$Ultimate##0 ~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~mem10 := read~int#2(~b.base, ~b.offset, 4); 6949#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~c.base, ~c.offset, 4); 6932#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 6943#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 6930#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 6933#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6958#L25-1 assume true; 6952#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6947#L25-1 assume true; 6948#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6974#L25-1 assume true; 6971#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6970#L25-1 assume true; 6969#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6968#L25-1 assume true; 6967#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6966#L25-1 assume true; 6964#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6962#L25-1 assume true; 6961#func_to_recursive_line_25_to_25_0EXIT >#80#return; 6953#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 6931#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 6943#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 6930#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 6933#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6958#L25-1 assume true; 6952#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6947#L25-1 assume true; 6948#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6974#L25-1 assume true; 6971#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6970#L25-1 assume true; 6969#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6968#L25-1 assume true; 6967#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6966#L25-1 assume true; 6964#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6962#L25-1 assume true; 6961#func_to_recursive_line_25_to_25_0EXIT >#80#return; 6953#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 6931#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 6943#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 6930#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 6933#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6958#L25-1 assume true; 6952#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6947#L25-1 assume true; 6948#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6974#L25-1 assume true; 6971#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6970#L25-1 assume true; 6969#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6968#L25-1 assume true; 6967#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6966#L25-1 assume true; 6964#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6962#L25-1 assume true; 6961#func_to_recursive_line_25_to_25_0EXIT >#80#return; 6953#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 6931#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 6943#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 6930#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6934#L41-1 assume true; 6950#func_to_recursive_line_24_to_25_0EXIT >#82#return; 6955#L41-1 assume true; 6977#func_to_recursive_line_24_to_25_0EXIT >#82#return; 6976#L41-1 assume true; 6975#func_to_recursive_line_24_to_25_0EXIT >#82#return; 6973#L41-1 assume true; 6972#func_to_recursive_line_24_to_25_0EXIT >#84#return; 6954#L67-1 call #t~mem11 := read~int#2(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 6927#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 6929#$Ultimate##0 ~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~mem10 := read~int#2(~b.base, ~b.offset, 4); 6949#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~c.base, ~c.offset, 4); 6932#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 6943#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 6930#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 6933#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6958#L25-1 assume true; 6952#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6947#L25-1 assume true; 6948#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6974#L25-1 assume true; 6971#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6970#L25-1 assume true; 6969#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6968#L25-1 assume true; 6967#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6966#L25-1 assume true; 6964#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6962#L25-1 assume true; 6961#func_to_recursive_line_25_to_25_0EXIT >#80#return; 6953#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 6931#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 6943#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 6930#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 6933#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6958#L25-1 assume true; 6952#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6947#L25-1 assume true; 6948#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6974#L25-1 assume true; 6971#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6970#L25-1 assume true; 6969#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6968#L25-1 assume true; 6967#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6966#L25-1 assume true; 6964#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6962#L25-1 assume true; 6961#func_to_recursive_line_25_to_25_0EXIT >#80#return; 6953#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 6931#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 6943#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 6930#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 6933#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 6945#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 6946#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 6957#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6958#L25-1 assume true; 6952#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6947#L25-1 assume true; 6948#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6974#L25-1 assume true; 6971#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6970#L25-1 assume true; 6969#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6968#L25-1 assume true; 6967#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6966#L25-1 assume true; 6964#func_to_recursive_line_25_to_25_0EXIT >#92#return; 6962#L25-1 assume true; 6961#func_to_recursive_line_25_to_25_0EXIT >#80#return; 6953#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 6931#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 6943#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 6930#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6934#L41-1 assume true; 6950#func_to_recursive_line_24_to_25_0EXIT >#82#return; 6955#L41-1 assume true; 6977#func_to_recursive_line_24_to_25_0EXIT >#82#return; 6976#L41-1 assume true; 6975#func_to_recursive_line_24_to_25_0EXIT >#82#return; 6973#L41-1 assume true; 6972#func_to_recursive_line_24_to_25_0EXIT >#84#return; 6954#L67-1 call #t~mem11 := read~int#2(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 6927#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 6929#$Ultimate##0 ~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~mem10 := read~int#2(~b.base, ~b.offset, 4); 6949#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 6951#L61-1 assume true; 6940#func_to_recursive_line_23_to_24_0EXIT >#86#return; 6935#L61-1 assume true; 6936#func_to_recursive_line_23_to_24_0EXIT >#86#return; 6965#L61-1 assume true; 6963#func_to_recursive_line_23_to_24_0EXIT >#86#return; 6960#L61-1 assume true; 6959#func_to_recursive_line_23_to_24_0EXIT >#88#return; 6944#L87-1 call #t~mem14 := read~int#3(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 6937#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 6939#$Ultimate##0 [2024-11-08 00:34:32,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:32,867 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 9 times [2024-11-08 00:34:32,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:32,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832409980] [2024-11-08 00:34:32,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:32,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:32,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:32,875 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:34:32,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:32,879 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:34:32,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:32,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1276539711, now seen corresponding path program 6 times [2024-11-08 00:34:32,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:32,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42979836] [2024-11-08 00:34:32,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:32,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:34,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:34,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:34:35,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:35,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:35,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:34:35,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:34:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 00:34:36,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:34:36,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:34:36,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:34:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 00:34:36,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:34:36,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:34:36,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:34:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 00:34:36,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:36,502 INFO L134 CoverageAnalysis]: Checked inductivity of 9648 backedges. 6 proven. 171 refuted. 0 times theorem prover too weak. 9471 trivial. 0 not checked. [2024-11-08 00:34:36,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 00:34:36,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42979836] [2024-11-08 00:34:36,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42979836] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 00:34:36,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428856646] [2024-11-08 00:34:36,502 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-08 00:34:36,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 00:34:36,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:34:36,509 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:36,510 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:37,044 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-11-08 00:34:37,044 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 00:34:37,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 845 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-08 00:34:37,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:34:37,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 00:34:37,302 INFO L134 CoverageAnalysis]: Checked inductivity of 9648 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 9633 trivial. 0 not checked. [2024-11-08 00:34:37,302 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 00:34:39,023 INFO L134 CoverageAnalysis]: Checked inductivity of 9648 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 9615 trivial. 0 not checked. [2024-11-08 00:34:39,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428856646] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 00:34:39,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 00:34:39,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 18] total 39 [2024-11-08 00:34:39,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688493615] [2024-11-08 00:34:39,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 00:34:39,026 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-08 00:34:39,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 00:34:39,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-08 00:34:39,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1284, Unknown=0, NotChecked=0, Total=1482 [2024-11-08 00:34:39,028 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. cyclomatic complexity: 10 Second operand has 39 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 31 states have internal predecessors, (57), 15 states have call successors, (24), 10 states have call predecessors, (24), 14 states have return successors, (24), 16 states have call predecessors, (24), 15 states have call successors, (24) [2024-11-08 00:34:39,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 00:34:39,677 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2024-11-08 00:34:39,677 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 61 transitions. [2024-11-08 00:34:39,681 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-08 00:34:39,681 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 55 states and 61 transitions. [2024-11-08 00:34:39,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2024-11-08 00:34:39,682 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2024-11-08 00:34:39,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 61 transitions. [2024-11-08 00:34:39,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 00:34:39,682 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 61 transitions. [2024-11-08 00:34:39,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 61 transitions. [2024-11-08 00:34:39,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-08 00:34:39,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 30 states have (on average 1.1) internal successors, (33), 33 states have internal predecessors, (33), 8 states have call successors, (8), 4 states have call predecessors, (8), 17 states have return successors, (20), 17 states have call predecessors, (20), 6 states have call successors, (20) [2024-11-08 00:34:39,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2024-11-08 00:34:39,689 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 61 transitions. [2024-11-08 00:34:39,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 00:34:39,692 INFO L425 stractBuchiCegarLoop]: Abstraction has 55 states and 61 transitions. [2024-11-08 00:34:39,692 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-08 00:34:39,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 61 transitions. [2024-11-08 00:34:39,692 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-08 00:34:39,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:34:39,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:34:39,701 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-08 00:34:39,701 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [112, 112, 96, 96, 96, 20, 20, 16, 16, 16, 16, 16, 16, 16, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 00:34:39,701 INFO L745 eck$LassoCheckResult]: Stem: 12391#$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); 12377#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(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 write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 12373#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 12374#$Ultimate##0 [2024-11-08 00:34:39,702 INFO L747 eck$LassoCheckResult]: Loop: 12374#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#3(~a.base, ~a.offset, 4); 12376#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~b.base, ~b.offset, 4); 12363#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 12364#$Ultimate##0 ~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~mem10 := read~int#2(~b.base, ~b.offset, 4); 12384#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~c.base, ~c.offset, 4); 12366#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 12378#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 12365#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 12368#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12382#L25-1 assume true; 12383#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12386#L25-1 assume true; 12413#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12411#L25-1 assume true; 12410#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12408#L25-1 assume true; 12404#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12402#L25-1 assume true; 12400#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12398#L25-1 assume true; 12396#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12393#L25-1 assume true; 12392#func_to_recursive_line_25_to_25_0EXIT >#80#return; 12387#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 12367#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 12378#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 12365#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 12368#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12382#L25-1 assume true; 12383#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12386#L25-1 assume true; 12413#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12411#L25-1 assume true; 12410#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12408#L25-1 assume true; 12404#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12402#L25-1 assume true; 12400#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12398#L25-1 assume true; 12396#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12393#L25-1 assume true; 12392#func_to_recursive_line_25_to_25_0EXIT >#80#return; 12387#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 12367#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 12378#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 12365#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 12368#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12382#L25-1 assume true; 12383#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12386#L25-1 assume true; 12413#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12411#L25-1 assume true; 12410#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12408#L25-1 assume true; 12404#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12402#L25-1 assume true; 12400#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12398#L25-1 assume true; 12396#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12393#L25-1 assume true; 12392#func_to_recursive_line_25_to_25_0EXIT >#80#return; 12387#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 12367#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 12378#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 12365#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 12368#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12382#L25-1 assume true; 12383#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12386#L25-1 assume true; 12413#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12411#L25-1 assume true; 12410#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12408#L25-1 assume true; 12404#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12402#L25-1 assume true; 12400#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12398#L25-1 assume true; 12396#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12393#L25-1 assume true; 12392#func_to_recursive_line_25_to_25_0EXIT >#80#return; 12387#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 12367#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 12378#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 12365#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12369#L41-1 assume true; 12385#func_to_recursive_line_24_to_25_0EXIT >#82#return; 12389#L41-1 assume true; 12416#func_to_recursive_line_24_to_25_0EXIT >#82#return; 12415#L41-1 assume true; 12414#func_to_recursive_line_24_to_25_0EXIT >#82#return; 12412#L41-1 assume true; 12409#func_to_recursive_line_24_to_25_0EXIT >#82#return; 12407#L41-1 assume true; 12406#func_to_recursive_line_24_to_25_0EXIT >#84#return; 12388#L67-1 call #t~mem11 := read~int#2(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 12362#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 12364#$Ultimate##0 ~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~mem10 := read~int#2(~b.base, ~b.offset, 4); 12384#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~c.base, ~c.offset, 4); 12366#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 12378#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 12365#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 12368#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12382#L25-1 assume true; 12383#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12386#L25-1 assume true; 12413#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12411#L25-1 assume true; 12410#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12408#L25-1 assume true; 12404#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12402#L25-1 assume true; 12400#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12398#L25-1 assume true; 12396#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12393#L25-1 assume true; 12392#func_to_recursive_line_25_to_25_0EXIT >#80#return; 12387#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 12367#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 12378#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 12365#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 12368#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12382#L25-1 assume true; 12383#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12386#L25-1 assume true; 12413#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12411#L25-1 assume true; 12410#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12408#L25-1 assume true; 12404#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12402#L25-1 assume true; 12400#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12398#L25-1 assume true; 12396#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12393#L25-1 assume true; 12392#func_to_recursive_line_25_to_25_0EXIT >#80#return; 12387#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 12367#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 12378#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 12365#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 12368#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12382#L25-1 assume true; 12383#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12386#L25-1 assume true; 12413#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12411#L25-1 assume true; 12410#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12408#L25-1 assume true; 12404#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12402#L25-1 assume true; 12400#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12398#L25-1 assume true; 12396#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12393#L25-1 assume true; 12392#func_to_recursive_line_25_to_25_0EXIT >#80#return; 12387#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 12367#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 12378#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 12365#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 12368#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12382#L25-1 assume true; 12383#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12386#L25-1 assume true; 12413#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12411#L25-1 assume true; 12410#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12408#L25-1 assume true; 12404#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12402#L25-1 assume true; 12400#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12398#L25-1 assume true; 12396#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12393#L25-1 assume true; 12392#func_to_recursive_line_25_to_25_0EXIT >#80#return; 12387#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 12367#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 12378#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 12365#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12369#L41-1 assume true; 12385#func_to_recursive_line_24_to_25_0EXIT >#82#return; 12389#L41-1 assume true; 12416#func_to_recursive_line_24_to_25_0EXIT >#82#return; 12415#L41-1 assume true; 12414#func_to_recursive_line_24_to_25_0EXIT >#82#return; 12412#L41-1 assume true; 12409#func_to_recursive_line_24_to_25_0EXIT >#82#return; 12407#L41-1 assume true; 12406#func_to_recursive_line_24_to_25_0EXIT >#84#return; 12388#L67-1 call #t~mem11 := read~int#2(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 12362#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 12364#$Ultimate##0 ~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~mem10 := read~int#2(~b.base, ~b.offset, 4); 12384#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~c.base, ~c.offset, 4); 12366#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 12378#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 12365#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 12368#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12382#L25-1 assume true; 12383#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12386#L25-1 assume true; 12413#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12411#L25-1 assume true; 12410#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12408#L25-1 assume true; 12404#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12402#L25-1 assume true; 12400#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12398#L25-1 assume true; 12396#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12393#L25-1 assume true; 12392#func_to_recursive_line_25_to_25_0EXIT >#80#return; 12387#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 12367#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 12378#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 12365#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 12368#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12382#L25-1 assume true; 12383#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12386#L25-1 assume true; 12413#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12411#L25-1 assume true; 12410#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12408#L25-1 assume true; 12404#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12402#L25-1 assume true; 12400#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12398#L25-1 assume true; 12396#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12393#L25-1 assume true; 12392#func_to_recursive_line_25_to_25_0EXIT >#80#return; 12387#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 12367#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 12378#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 12365#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 12368#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12382#L25-1 assume true; 12383#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12386#L25-1 assume true; 12413#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12411#L25-1 assume true; 12410#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12408#L25-1 assume true; 12404#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12402#L25-1 assume true; 12400#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12398#L25-1 assume true; 12396#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12393#L25-1 assume true; 12392#func_to_recursive_line_25_to_25_0EXIT >#80#return; 12387#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 12367#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 12378#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 12365#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 12368#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12382#L25-1 assume true; 12383#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12386#L25-1 assume true; 12413#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12411#L25-1 assume true; 12410#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12408#L25-1 assume true; 12404#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12402#L25-1 assume true; 12400#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12398#L25-1 assume true; 12396#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12393#L25-1 assume true; 12392#func_to_recursive_line_25_to_25_0EXIT >#80#return; 12387#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 12367#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 12378#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 12365#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12369#L41-1 assume true; 12385#func_to_recursive_line_24_to_25_0EXIT >#82#return; 12389#L41-1 assume true; 12416#func_to_recursive_line_24_to_25_0EXIT >#82#return; 12415#L41-1 assume true; 12414#func_to_recursive_line_24_to_25_0EXIT >#82#return; 12412#L41-1 assume true; 12409#func_to_recursive_line_24_to_25_0EXIT >#82#return; 12407#L41-1 assume true; 12406#func_to_recursive_line_24_to_25_0EXIT >#84#return; 12388#L67-1 call #t~mem11 := read~int#2(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 12362#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 12364#$Ultimate##0 ~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~mem10 := read~int#2(~b.base, ~b.offset, 4); 12384#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~c.base, ~c.offset, 4); 12366#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 12378#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 12365#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 12368#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12382#L25-1 assume true; 12383#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12386#L25-1 assume true; 12413#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12411#L25-1 assume true; 12410#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12408#L25-1 assume true; 12404#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12402#L25-1 assume true; 12400#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12398#L25-1 assume true; 12396#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12393#L25-1 assume true; 12392#func_to_recursive_line_25_to_25_0EXIT >#80#return; 12387#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 12367#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 12378#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 12365#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 12368#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12382#L25-1 assume true; 12383#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12386#L25-1 assume true; 12413#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12411#L25-1 assume true; 12410#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12408#L25-1 assume true; 12404#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12402#L25-1 assume true; 12400#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12398#L25-1 assume true; 12396#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12393#L25-1 assume true; 12392#func_to_recursive_line_25_to_25_0EXIT >#80#return; 12387#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 12367#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 12378#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 12365#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 12368#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12382#L25-1 assume true; 12383#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12386#L25-1 assume true; 12413#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12411#L25-1 assume true; 12410#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12408#L25-1 assume true; 12404#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12402#L25-1 assume true; 12400#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12398#L25-1 assume true; 12396#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12393#L25-1 assume true; 12392#func_to_recursive_line_25_to_25_0EXIT >#80#return; 12387#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 12367#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 12378#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 12365#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 12368#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 12379#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 12380#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 12390#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 12382#L25-1 assume true; 12383#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12386#L25-1 assume true; 12413#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12411#L25-1 assume true; 12410#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12408#L25-1 assume true; 12404#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12402#L25-1 assume true; 12400#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12398#L25-1 assume true; 12396#func_to_recursive_line_25_to_25_0EXIT >#92#return; 12393#L25-1 assume true; 12392#func_to_recursive_line_25_to_25_0EXIT >#80#return; 12387#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 12367#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 12378#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 12365#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 12369#L41-1 assume true; 12385#func_to_recursive_line_24_to_25_0EXIT >#82#return; 12389#L41-1 assume true; 12416#func_to_recursive_line_24_to_25_0EXIT >#82#return; 12415#L41-1 assume true; 12414#func_to_recursive_line_24_to_25_0EXIT >#82#return; 12412#L41-1 assume true; 12409#func_to_recursive_line_24_to_25_0EXIT >#82#return; 12407#L41-1 assume true; 12406#func_to_recursive_line_24_to_25_0EXIT >#84#return; 12388#L67-1 call #t~mem11 := read~int#2(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 12362#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 12364#$Ultimate##0 ~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~mem10 := read~int#2(~b.base, ~b.offset, 4); 12384#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 12370#L61-1 assume true; 12371#func_to_recursive_line_23_to_24_0EXIT >#86#return; 12375#L61-1 assume true; 12405#func_to_recursive_line_23_to_24_0EXIT >#86#return; 12403#L61-1 assume true; 12401#func_to_recursive_line_23_to_24_0EXIT >#86#return; 12399#L61-1 assume true; 12397#func_to_recursive_line_23_to_24_0EXIT >#86#return; 12395#L61-1 assume true; 12394#func_to_recursive_line_23_to_24_0EXIT >#88#return; 12381#L87-1 call #t~mem14 := read~int#3(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 12372#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 12374#$Ultimate##0 [2024-11-08 00:34:39,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:39,707 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 10 times [2024-11-08 00:34:39,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:39,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112658133] [2024-11-08 00:34:39,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:39,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:39,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:39,718 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:34:39,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:39,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:34:39,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:39,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1508638848, now seen corresponding path program 7 times [2024-11-08 00:34:39,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:39,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610788344] [2024-11-08 00:34:39,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:39,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:39,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:42,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:44,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:44,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:44,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:44,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:44,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:44,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:44,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:44,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:44,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:44,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:44,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:44,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:44,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:44,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:44,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:44,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:34:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:45,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:45,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:45,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:45,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:45,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:45,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:45,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:45,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:45,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:45,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:45,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:45,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:45,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:34:45,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:45,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:45,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:45,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:45,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:45,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:45,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:45,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:45,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:45,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:45,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:45,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:45,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:45,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:45,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:34:45,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:45,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:45,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:45,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:45,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:45,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:45,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:45,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:45,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:45,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:45,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:45,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:45,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:45,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:34:46,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 00:34:46,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:34:46,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:34:46,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:34:46,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:34:46,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 00:34:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:34:46,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:34:46,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:34:46,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:34:46,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 00:34:46,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:34:46,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:34:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:34:46,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:46,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:34:46,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 00:34:46,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:46,968 INFO L134 CoverageAnalysis]: Checked inductivity of 30602 backedges. 20 proven. 402 refuted. 0 times theorem prover too weak. 30180 trivial. 0 not checked. [2024-11-08 00:34:46,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 00:34:46,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610788344] [2024-11-08 00:34:46,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610788344] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 00:34:46,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196059075] [2024-11-08 00:34:46,969 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-08 00:34:46,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 00:34:46,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:34:46,971 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:34:46,972 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:34:47,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:47,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 4056 conjuncts, 117 conjuncts are in the unsatisfiable core [2024-11-08 00:34:47,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:34:47,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 00:34:47,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-08 00:34:47,935 INFO L134 CoverageAnalysis]: Checked inductivity of 30602 backedges. 11591 proven. 24 refuted. 0 times theorem prover too weak. 18987 trivial. 0 not checked. [2024-11-08 00:34:47,935 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 00:34:51,456 INFO L134 CoverageAnalysis]: Checked inductivity of 30602 backedges. 8 proven. 511 refuted. 0 times theorem prover too weak. 30083 trivial. 0 not checked. [2024-11-08 00:34:51,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196059075] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 00:34:51,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 00:34:51,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 22] total 43 [2024-11-08 00:34:51,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820308980] [2024-11-08 00:34:51,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 00:34:51,458 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-08 00:34:51,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 00:34:51,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-08 00:34:51,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=1491, Unknown=0, NotChecked=0, Total=1806 [2024-11-08 00:34:51,460 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. cyclomatic complexity: 10 Second operand has 43 states, 33 states have (on average 2.272727272727273) internal successors, (75), 34 states have internal predecessors, (75), 18 states have call successors, (37), 11 states have call predecessors, (37), 13 states have return successors, (33), 17 states have call predecessors, (33), 18 states have call successors, (33) [2024-11-08 00:34:51,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 00:34:51,901 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2024-11-08 00:34:51,901 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 65 transitions. [2024-11-08 00:34:51,903 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-08 00:34:51,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 59 states and 65 transitions. [2024-11-08 00:34:51,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2024-11-08 00:34:51,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2024-11-08 00:34:51,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 65 transitions. [2024-11-08 00:34:51,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 00:34:51,904 INFO L218 hiAutomatonCegarLoop]: Abstraction has 59 states and 65 transitions. [2024-11-08 00:34:51,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 65 transitions. [2024-11-08 00:34:51,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-08 00:34:51,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 32 states have (on average 1.09375) internal successors, (35), 35 states have internal predecessors, (35), 8 states have call successors, (8), 4 states have call predecessors, (8), 19 states have return successors, (22), 19 states have call predecessors, (22), 6 states have call successors, (22) [2024-11-08 00:34:51,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2024-11-08 00:34:51,912 INFO L240 hiAutomatonCegarLoop]: Abstraction has 59 states and 65 transitions. [2024-11-08 00:34:51,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 00:34:51,913 INFO L425 stractBuchiCegarLoop]: Abstraction has 59 states and 65 transitions. [2024-11-08 00:34:51,913 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-08 00:34:51,913 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 65 transitions. [2024-11-08 00:34:51,914 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-08 00:34:51,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:34:51,914 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:34:51,921 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-08 00:34:51,926 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [168, 168, 144, 144, 144, 28, 28, 24, 24, 24, 24, 24, 24, 24, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 00:34:51,926 INFO L745 eck$LassoCheckResult]: Stem: 22432#$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); 22419#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(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 write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 22415#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 22416#$Ultimate##0 [2024-11-08 00:34:51,927 INFO L747 eck$LassoCheckResult]: Loop: 22416#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#3(~a.base, ~a.offset, 4); 22418#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~b.base, ~b.offset, 4); 22405#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 22406#$Ultimate##0 ~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~mem10 := read~int#2(~b.base, ~b.offset, 4); 22426#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~c.base, ~c.offset, 4); 22408#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22420#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 22407#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 22410#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22424#L25-1 assume true; 22425#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22429#L25-1 assume true; 22452#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22451#L25-1 assume true; 22450#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22449#L25-1 assume true; 22448#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22446#L25-1 assume true; 22444#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22442#L25-1 assume true; 22440#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22438#L25-1 assume true; 22437#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22430#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22409#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22420#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 22407#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 22410#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22424#L25-1 assume true; 22425#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22429#L25-1 assume true; 22452#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22451#L25-1 assume true; 22450#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22449#L25-1 assume true; 22448#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22446#L25-1 assume true; 22444#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22442#L25-1 assume true; 22440#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22438#L25-1 assume true; 22437#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22430#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22409#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22420#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 22407#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 22410#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22424#L25-1 assume true; 22425#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22429#L25-1 assume true; 22452#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22451#L25-1 assume true; 22450#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22449#L25-1 assume true; 22448#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22446#L25-1 assume true; 22444#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22442#L25-1 assume true; 22440#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22438#L25-1 assume true; 22437#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22430#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22409#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22420#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 22407#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 22410#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22424#L25-1 assume true; 22425#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22429#L25-1 assume true; 22452#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22451#L25-1 assume true; 22450#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22449#L25-1 assume true; 22448#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22446#L25-1 assume true; 22444#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22442#L25-1 assume true; 22440#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22438#L25-1 assume true; 22437#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22430#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22409#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22420#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 22407#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 22410#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22424#L25-1 assume true; 22425#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22429#L25-1 assume true; 22452#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22451#L25-1 assume true; 22450#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22449#L25-1 assume true; 22448#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22446#L25-1 assume true; 22444#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22442#L25-1 assume true; 22440#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22438#L25-1 assume true; 22437#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22430#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22409#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22420#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 22407#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 22410#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22424#L25-1 assume true; 22425#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22429#L25-1 assume true; 22452#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22451#L25-1 assume true; 22450#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22449#L25-1 assume true; 22448#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22446#L25-1 assume true; 22444#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22442#L25-1 assume true; 22440#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22438#L25-1 assume true; 22437#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22430#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22409#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22420#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 22407#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 22411#L41-1 assume true; 22433#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22427#L41-1 assume true; 22428#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22462#L41-1 assume true; 22461#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22460#L41-1 assume true; 22459#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22458#L41-1 assume true; 22457#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22456#L41-1 assume true; 22455#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22454#L41-1 assume true; 22453#func_to_recursive_line_24_to_25_0EXIT >#84#return; 22431#L67-1 call #t~mem11 := read~int#2(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 22404#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 22406#$Ultimate##0 ~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~mem10 := read~int#2(~b.base, ~b.offset, 4); 22426#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~c.base, ~c.offset, 4); 22408#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22420#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 22407#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 22410#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22424#L25-1 assume true; 22425#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22429#L25-1 assume true; 22452#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22451#L25-1 assume true; 22450#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22449#L25-1 assume true; 22448#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22446#L25-1 assume true; 22444#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22442#L25-1 assume true; 22440#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22438#L25-1 assume true; 22437#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22430#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22409#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22420#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 22407#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 22410#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22424#L25-1 assume true; 22425#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22429#L25-1 assume true; 22452#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22451#L25-1 assume true; 22450#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22449#L25-1 assume true; 22448#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22446#L25-1 assume true; 22444#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22442#L25-1 assume true; 22440#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22438#L25-1 assume true; 22437#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22430#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22409#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22420#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 22407#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 22410#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22424#L25-1 assume true; 22425#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22429#L25-1 assume true; 22452#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22451#L25-1 assume true; 22450#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22449#L25-1 assume true; 22448#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22446#L25-1 assume true; 22444#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22442#L25-1 assume true; 22440#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22438#L25-1 assume true; 22437#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22430#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22409#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22420#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 22407#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 22410#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22424#L25-1 assume true; 22425#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22429#L25-1 assume true; 22452#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22451#L25-1 assume true; 22450#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22449#L25-1 assume true; 22448#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22446#L25-1 assume true; 22444#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22442#L25-1 assume true; 22440#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22438#L25-1 assume true; 22437#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22430#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22409#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22420#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 22407#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 22410#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22424#L25-1 assume true; 22425#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22429#L25-1 assume true; 22452#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22451#L25-1 assume true; 22450#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22449#L25-1 assume true; 22448#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22446#L25-1 assume true; 22444#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22442#L25-1 assume true; 22440#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22438#L25-1 assume true; 22437#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22430#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22409#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22420#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 22407#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 22410#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22424#L25-1 assume true; 22425#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22429#L25-1 assume true; 22452#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22451#L25-1 assume true; 22450#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22449#L25-1 assume true; 22448#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22446#L25-1 assume true; 22444#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22442#L25-1 assume true; 22440#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22438#L25-1 assume true; 22437#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22430#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22409#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22420#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 22407#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 22411#L41-1 assume true; 22433#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22427#L41-1 assume true; 22428#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22462#L41-1 assume true; 22461#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22460#L41-1 assume true; 22459#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22458#L41-1 assume true; 22457#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22456#L41-1 assume true; 22455#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22454#L41-1 assume true; 22453#func_to_recursive_line_24_to_25_0EXIT >#84#return; 22431#L67-1 call #t~mem11 := read~int#2(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 22404#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 22406#$Ultimate##0 ~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~mem10 := read~int#2(~b.base, ~b.offset, 4); 22426#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~c.base, ~c.offset, 4); 22408#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22420#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 22407#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 22410#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22424#L25-1 assume true; 22425#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22429#L25-1 assume true; 22452#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22451#L25-1 assume true; 22450#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22449#L25-1 assume true; 22448#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22446#L25-1 assume true; 22444#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22442#L25-1 assume true; 22440#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22438#L25-1 assume true; 22437#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22430#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22409#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22420#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 22407#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 22410#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22424#L25-1 assume true; 22425#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22429#L25-1 assume true; 22452#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22451#L25-1 assume true; 22450#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22449#L25-1 assume true; 22448#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22446#L25-1 assume true; 22444#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22442#L25-1 assume true; 22440#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22438#L25-1 assume true; 22437#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22430#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22409#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22420#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 22407#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 22410#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22424#L25-1 assume true; 22425#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22429#L25-1 assume true; 22452#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22451#L25-1 assume true; 22450#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22449#L25-1 assume true; 22448#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22446#L25-1 assume true; 22444#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22442#L25-1 assume true; 22440#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22438#L25-1 assume true; 22437#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22430#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22409#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22420#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 22407#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 22410#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22424#L25-1 assume true; 22425#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22429#L25-1 assume true; 22452#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22451#L25-1 assume true; 22450#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22449#L25-1 assume true; 22448#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22446#L25-1 assume true; 22444#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22442#L25-1 assume true; 22440#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22438#L25-1 assume true; 22437#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22430#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22409#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22420#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 22407#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 22410#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22424#L25-1 assume true; 22425#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22429#L25-1 assume true; 22452#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22451#L25-1 assume true; 22450#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22449#L25-1 assume true; 22448#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22446#L25-1 assume true; 22444#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22442#L25-1 assume true; 22440#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22438#L25-1 assume true; 22437#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22430#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22409#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22420#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 22407#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 22410#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22424#L25-1 assume true; 22425#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22429#L25-1 assume true; 22452#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22451#L25-1 assume true; 22450#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22449#L25-1 assume true; 22448#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22446#L25-1 assume true; 22444#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22442#L25-1 assume true; 22440#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22438#L25-1 assume true; 22437#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22430#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22409#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22420#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 22407#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 22411#L41-1 assume true; 22433#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22427#L41-1 assume true; 22428#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22462#L41-1 assume true; 22461#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22460#L41-1 assume true; 22459#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22458#L41-1 assume true; 22457#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22456#L41-1 assume true; 22455#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22454#L41-1 assume true; 22453#func_to_recursive_line_24_to_25_0EXIT >#84#return; 22431#L67-1 call #t~mem11 := read~int#2(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 22404#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 22406#$Ultimate##0 ~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~mem10 := read~int#2(~b.base, ~b.offset, 4); 22426#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~c.base, ~c.offset, 4); 22408#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22420#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 22407#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 22410#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22424#L25-1 assume true; 22425#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22429#L25-1 assume true; 22452#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22451#L25-1 assume true; 22450#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22449#L25-1 assume true; 22448#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22446#L25-1 assume true; 22444#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22442#L25-1 assume true; 22440#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22438#L25-1 assume true; 22437#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22430#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22409#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22420#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 22407#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 22410#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22424#L25-1 assume true; 22425#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22429#L25-1 assume true; 22452#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22451#L25-1 assume true; 22450#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22449#L25-1 assume true; 22448#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22446#L25-1 assume true; 22444#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22442#L25-1 assume true; 22440#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22438#L25-1 assume true; 22437#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22430#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22409#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22420#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 22407#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 22410#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22424#L25-1 assume true; 22425#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22429#L25-1 assume true; 22452#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22451#L25-1 assume true; 22450#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22449#L25-1 assume true; 22448#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22446#L25-1 assume true; 22444#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22442#L25-1 assume true; 22440#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22438#L25-1 assume true; 22437#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22430#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22409#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22420#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 22407#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 22410#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22424#L25-1 assume true; 22425#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22429#L25-1 assume true; 22452#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22451#L25-1 assume true; 22450#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22449#L25-1 assume true; 22448#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22446#L25-1 assume true; 22444#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22442#L25-1 assume true; 22440#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22438#L25-1 assume true; 22437#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22430#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22409#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22420#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 22407#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 22410#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22424#L25-1 assume true; 22425#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22429#L25-1 assume true; 22452#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22451#L25-1 assume true; 22450#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22449#L25-1 assume true; 22448#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22446#L25-1 assume true; 22444#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22442#L25-1 assume true; 22440#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22438#L25-1 assume true; 22437#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22430#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22409#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22420#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 22407#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 22410#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 22422#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 22423#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 22434#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 22424#L25-1 assume true; 22425#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22429#L25-1 assume true; 22452#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22451#L25-1 assume true; 22450#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22449#L25-1 assume true; 22448#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22446#L25-1 assume true; 22444#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22442#L25-1 assume true; 22440#func_to_recursive_line_25_to_25_0EXIT >#92#return; 22438#L25-1 assume true; 22437#func_to_recursive_line_25_to_25_0EXIT >#80#return; 22430#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 22409#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 22420#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 22407#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 22411#L41-1 assume true; 22433#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22427#L41-1 assume true; 22428#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22462#L41-1 assume true; 22461#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22460#L41-1 assume true; 22459#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22458#L41-1 assume true; 22457#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22456#L41-1 assume true; 22455#func_to_recursive_line_24_to_25_0EXIT >#82#return; 22454#L41-1 assume true; 22453#func_to_recursive_line_24_to_25_0EXIT >#84#return; 22431#L67-1 call #t~mem11 := read~int#2(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 22404#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 22406#$Ultimate##0 ~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~mem10 := read~int#2(~b.base, ~b.offset, 4); 22426#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 22412#L61-1 assume true; 22413#func_to_recursive_line_23_to_24_0EXIT >#86#return; 22417#L61-1 assume true; 22447#func_to_recursive_line_23_to_24_0EXIT >#86#return; 22445#L61-1 assume true; 22443#func_to_recursive_line_23_to_24_0EXIT >#86#return; 22441#L61-1 assume true; 22439#func_to_recursive_line_23_to_24_0EXIT >#86#return; 22436#L61-1 assume true; 22435#func_to_recursive_line_23_to_24_0EXIT >#88#return; 22421#L87-1 call #t~mem14 := read~int#3(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 22414#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 22416#$Ultimate##0 [2024-11-08 00:34:51,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:51,927 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 11 times [2024-11-08 00:34:51,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:51,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489819116] [2024-11-08 00:34:51,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:51,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:51,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:51,939 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:34:51,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:34:51,955 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:34:51,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:34:51,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1880621056, now seen corresponding path program 8 times [2024-11-08 00:34:51,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:34:51,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273219559] [2024-11-08 00:34:51,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:34:51,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:34:52,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:55,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:56,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:59,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:59,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:59,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:59,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:34:59,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:34:59,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:00,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:00,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:00,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:00,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:00,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:00,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:00,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:00,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:00,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:00,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:00,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:00,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:00,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:00,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:00,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:00,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:00,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:00,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:00,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:00,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:00,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:00,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:00,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:00,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:00,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:00,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:00,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:00,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:00,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:00,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:00,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:00,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:00,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:00,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:00,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:00,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:00,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:00,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:00,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:00,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:00,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:00,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:00,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:00,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:00,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:00,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:00,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:00,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:00,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:00,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:00,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:00,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:00,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:00,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:00,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:00,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:00,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:00,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:00,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:00,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:00,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:00,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:00,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:00,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:00,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:00,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:00,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:00,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:00,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:00,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:00,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:00,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:00,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:00,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:00,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:00,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:00,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:00,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:00,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:00,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:00,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:00,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:00,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-08 00:35:00,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:03,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:03,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:03,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:03,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:03,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:03,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-08 00:35:03,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:04,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:04,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:04,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:04,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:05,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:05,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-08 00:35:05,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:05,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:05,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:05,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:05,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:05,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 00:35:05,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 00:35:05,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:05,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-08 00:35:05,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 00:35:06,027 INFO L134 CoverageAnalysis]: Checked inductivity of 68806 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 68770 trivial. 0 not checked. [2024-11-08 00:35:06,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 00:35:06,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273219559] [2024-11-08 00:35:06,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273219559] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 00:35:06,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42252177] [2024-11-08 00:35:06,028 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 00:35:06,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 00:35:06,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 00:35:06,033 INFO L229 MonitoredProcess]: Starting monitored process 9 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:06,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 00:35:07,207 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 00:35:07,207 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 00:35:07,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 5864 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-08 00:35:07,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 00:35:07,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 00:35:07,564 INFO L134 CoverageAnalysis]: Checked inductivity of 68806 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 68782 trivial. 0 not checked. [2024-11-08 00:35:07,564 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 00:35:11,485 INFO L134 CoverageAnalysis]: Checked inductivity of 68806 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 68748 trivial. 0 not checked. [2024-11-08 00:35:11,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42252177] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 00:35:11,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 00:35:11,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 22] total 43 [2024-11-08 00:35:11,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251292450] [2024-11-08 00:35:11,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 00:35:11,487 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-08 00:35:11,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 00:35:11,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-08 00:35:11,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=1497, Unknown=0, NotChecked=0, Total=1806 [2024-11-08 00:35:11,489 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. cyclomatic complexity: 10 Second operand has 43 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 34 states have internal predecessors, (54), 18 states have call successors, (24), 11 states have call predecessors, (24), 12 states have return successors, (24), 17 states have call predecessors, (24), 17 states have call successors, (24) [2024-11-08 00:35:11,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 00:35:11,882 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2024-11-08 00:35:11,882 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 69 transitions. [2024-11-08 00:35:11,883 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-08 00:35:11,883 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 63 states and 69 transitions. [2024-11-08 00:35:11,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2024-11-08 00:35:11,883 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2024-11-08 00:35:11,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 69 transitions. [2024-11-08 00:35:11,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 00:35:11,884 INFO L218 hiAutomatonCegarLoop]: Abstraction has 63 states and 69 transitions. [2024-11-08 00:35:11,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 69 transitions. [2024-11-08 00:35:11,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-08 00:35:11,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 34 states have (on average 1.088235294117647) internal successors, (37), 37 states have internal predecessors, (37), 8 states have call successors, (8), 4 states have call predecessors, (8), 21 states have return successors, (24), 21 states have call predecessors, (24), 6 states have call successors, (24) [2024-11-08 00:35:11,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2024-11-08 00:35:11,891 INFO L240 hiAutomatonCegarLoop]: Abstraction has 63 states and 69 transitions. [2024-11-08 00:35:11,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 00:35:11,892 INFO L425 stractBuchiCegarLoop]: Abstraction has 63 states and 69 transitions. [2024-11-08 00:35:11,892 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-08 00:35:11,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 69 transitions. [2024-11-08 00:35:11,892 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-08 00:35:11,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 00:35:11,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 00:35:11,896 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-08 00:35:11,896 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [252, 252, 216, 216, 216, 42, 42, 36, 36, 36, 36, 36, 36, 36, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 00:35:11,896 INFO L745 eck$LassoCheckResult]: Stem: 38172#$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); 38159#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#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;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(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 write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 38155#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 38156#$Ultimate##0 [2024-11-08 00:35:11,897 INFO L747 eck$LassoCheckResult]: Loop: 38156#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#3(~a.base, ~a.offset, 4); 38158#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~b.base, ~b.offset, 4); 38145#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 38146#$Ultimate##0 ~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~mem10 := read~int#2(~b.base, ~b.offset, 4); 38166#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~c.base, ~c.offset, 4); 38148#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38160#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 38147#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 38150#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38164#L25-1 assume true; 38165#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38169#L25-1 assume true; 38200#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38196#L25-1 assume true; 38194#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38192#L25-1 assume true; 38187#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38185#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38179#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38176#L25-1 assume true; 38175#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38170#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38149#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38160#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 38147#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 38150#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38164#L25-1 assume true; 38165#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38169#L25-1 assume true; 38200#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38196#L25-1 assume true; 38194#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38192#L25-1 assume true; 38187#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38185#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38179#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38176#L25-1 assume true; 38175#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38170#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38149#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38160#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 38147#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 38150#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38164#L25-1 assume true; 38165#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38169#L25-1 assume true; 38200#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38196#L25-1 assume true; 38194#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38192#L25-1 assume true; 38187#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38185#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38179#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38176#L25-1 assume true; 38175#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38170#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38149#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38160#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 38147#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 38150#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38164#L25-1 assume true; 38165#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38169#L25-1 assume true; 38200#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38196#L25-1 assume true; 38194#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38192#L25-1 assume true; 38187#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38185#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38179#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38176#L25-1 assume true; 38175#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38170#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38149#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38160#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 38147#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 38150#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38164#L25-1 assume true; 38165#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38169#L25-1 assume true; 38200#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38196#L25-1 assume true; 38194#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38192#L25-1 assume true; 38187#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38185#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38179#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38176#L25-1 assume true; 38175#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38170#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38149#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38160#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 38147#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 38150#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38164#L25-1 assume true; 38165#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38169#L25-1 assume true; 38200#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38196#L25-1 assume true; 38194#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38192#L25-1 assume true; 38187#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38185#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38179#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38176#L25-1 assume true; 38175#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38170#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38149#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38160#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 38147#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 38151#L41-1 assume true; 38167#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38173#L41-1 assume true; 38206#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38205#L41-1 assume true; 38204#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38203#L41-1 assume true; 38202#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38201#L41-1 assume true; 38199#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38198#L41-1 assume true; 38193#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38190#L41-1 assume true; 38189#func_to_recursive_line_24_to_25_0EXIT >#84#return; 38171#L67-1 call #t~mem11 := read~int#2(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 38144#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 38146#$Ultimate##0 ~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~mem10 := read~int#2(~b.base, ~b.offset, 4); 38166#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~c.base, ~c.offset, 4); 38148#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38160#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 38147#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 38150#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38164#L25-1 assume true; 38165#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38169#L25-1 assume true; 38200#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38196#L25-1 assume true; 38194#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38192#L25-1 assume true; 38187#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38185#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38179#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38176#L25-1 assume true; 38175#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38170#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38149#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38160#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 38147#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 38150#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38164#L25-1 assume true; 38165#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38169#L25-1 assume true; 38200#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38196#L25-1 assume true; 38194#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38192#L25-1 assume true; 38187#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38185#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38179#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38176#L25-1 assume true; 38175#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38170#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38149#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38160#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 38147#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 38150#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38164#L25-1 assume true; 38165#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38169#L25-1 assume true; 38200#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38196#L25-1 assume true; 38194#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38192#L25-1 assume true; 38187#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38185#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38179#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38176#L25-1 assume true; 38175#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38170#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38149#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38160#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 38147#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 38150#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38164#L25-1 assume true; 38165#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38169#L25-1 assume true; 38200#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38196#L25-1 assume true; 38194#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38192#L25-1 assume true; 38187#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38185#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38179#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38176#L25-1 assume true; 38175#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38170#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38149#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38160#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 38147#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 38150#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38164#L25-1 assume true; 38165#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38169#L25-1 assume true; 38200#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38196#L25-1 assume true; 38194#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38192#L25-1 assume true; 38187#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38185#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38179#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38176#L25-1 assume true; 38175#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38170#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38149#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38160#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 38147#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 38150#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38164#L25-1 assume true; 38165#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38169#L25-1 assume true; 38200#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38196#L25-1 assume true; 38194#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38192#L25-1 assume true; 38187#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38185#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38179#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38176#L25-1 assume true; 38175#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38170#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38149#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38160#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 38147#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 38151#L41-1 assume true; 38167#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38173#L41-1 assume true; 38206#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38205#L41-1 assume true; 38204#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38203#L41-1 assume true; 38202#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38201#L41-1 assume true; 38199#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38198#L41-1 assume true; 38193#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38190#L41-1 assume true; 38189#func_to_recursive_line_24_to_25_0EXIT >#84#return; 38171#L67-1 call #t~mem11 := read~int#2(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 38144#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 38146#$Ultimate##0 ~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~mem10 := read~int#2(~b.base, ~b.offset, 4); 38166#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~c.base, ~c.offset, 4); 38148#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38160#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 38147#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 38150#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38164#L25-1 assume true; 38165#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38169#L25-1 assume true; 38200#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38196#L25-1 assume true; 38194#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38192#L25-1 assume true; 38187#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38185#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38179#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38176#L25-1 assume true; 38175#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38170#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38149#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38160#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 38147#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 38150#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38164#L25-1 assume true; 38165#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38169#L25-1 assume true; 38200#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38196#L25-1 assume true; 38194#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38192#L25-1 assume true; 38187#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38185#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38179#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38176#L25-1 assume true; 38175#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38170#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38149#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38160#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 38147#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 38150#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38164#L25-1 assume true; 38165#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38169#L25-1 assume true; 38200#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38196#L25-1 assume true; 38194#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38192#L25-1 assume true; 38187#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38185#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38179#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38176#L25-1 assume true; 38175#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38170#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38149#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38160#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 38147#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 38150#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38164#L25-1 assume true; 38165#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38169#L25-1 assume true; 38200#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38196#L25-1 assume true; 38194#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38192#L25-1 assume true; 38187#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38185#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38179#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38176#L25-1 assume true; 38175#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38170#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38149#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38160#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 38147#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 38150#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38164#L25-1 assume true; 38165#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38169#L25-1 assume true; 38200#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38196#L25-1 assume true; 38194#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38192#L25-1 assume true; 38187#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38185#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38179#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38176#L25-1 assume true; 38175#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38170#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38149#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38160#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 38147#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 38150#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38164#L25-1 assume true; 38165#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38169#L25-1 assume true; 38200#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38196#L25-1 assume true; 38194#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38192#L25-1 assume true; 38187#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38185#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38179#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38176#L25-1 assume true; 38175#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38170#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38149#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38160#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 38147#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 38151#L41-1 assume true; 38167#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38173#L41-1 assume true; 38206#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38205#L41-1 assume true; 38204#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38203#L41-1 assume true; 38202#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38201#L41-1 assume true; 38199#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38198#L41-1 assume true; 38193#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38190#L41-1 assume true; 38189#func_to_recursive_line_24_to_25_0EXIT >#84#return; 38171#L67-1 call #t~mem11 := read~int#2(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 38144#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 38146#$Ultimate##0 ~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~mem10 := read~int#2(~b.base, ~b.offset, 4); 38166#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~c.base, ~c.offset, 4); 38148#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38160#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 38147#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 38150#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38164#L25-1 assume true; 38165#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38169#L25-1 assume true; 38200#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38196#L25-1 assume true; 38194#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38192#L25-1 assume true; 38187#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38185#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38179#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38176#L25-1 assume true; 38175#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38170#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38149#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38160#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 38147#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 38150#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38164#L25-1 assume true; 38165#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38169#L25-1 assume true; 38200#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38196#L25-1 assume true; 38194#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38192#L25-1 assume true; 38187#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38185#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38179#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38176#L25-1 assume true; 38175#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38170#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38149#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38160#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 38147#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 38150#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38164#L25-1 assume true; 38165#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38169#L25-1 assume true; 38200#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38196#L25-1 assume true; 38194#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38192#L25-1 assume true; 38187#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38185#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38179#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38176#L25-1 assume true; 38175#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38170#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38149#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38160#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 38147#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 38150#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38164#L25-1 assume true; 38165#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38169#L25-1 assume true; 38200#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38196#L25-1 assume true; 38194#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38192#L25-1 assume true; 38187#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38185#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38179#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38176#L25-1 assume true; 38175#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38170#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38149#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38160#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 38147#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 38150#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38164#L25-1 assume true; 38165#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38169#L25-1 assume true; 38200#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38196#L25-1 assume true; 38194#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38192#L25-1 assume true; 38187#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38185#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38179#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38176#L25-1 assume true; 38175#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38170#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38149#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38160#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 38147#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 38150#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38164#L25-1 assume true; 38165#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38169#L25-1 assume true; 38200#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38196#L25-1 assume true; 38194#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38192#L25-1 assume true; 38187#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38185#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38179#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38176#L25-1 assume true; 38175#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38170#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38149#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38160#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 38147#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 38151#L41-1 assume true; 38167#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38173#L41-1 assume true; 38206#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38205#L41-1 assume true; 38204#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38203#L41-1 assume true; 38202#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38201#L41-1 assume true; 38199#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38198#L41-1 assume true; 38193#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38190#L41-1 assume true; 38189#func_to_recursive_line_24_to_25_0EXIT >#84#return; 38171#L67-1 call #t~mem11 := read~int#2(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 38144#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 38146#$Ultimate##0 ~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~mem10 := read~int#2(~b.base, ~b.offset, 4); 38166#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~c.base, ~c.offset, 4); 38148#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38160#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 38147#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 38150#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38164#L25-1 assume true; 38165#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38169#L25-1 assume true; 38200#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38196#L25-1 assume true; 38194#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38192#L25-1 assume true; 38187#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38185#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38179#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38176#L25-1 assume true; 38175#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38170#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38149#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38160#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 38147#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 38150#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38164#L25-1 assume true; 38165#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38169#L25-1 assume true; 38200#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38196#L25-1 assume true; 38194#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38192#L25-1 assume true; 38187#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38185#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38179#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38176#L25-1 assume true; 38175#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38170#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38149#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38160#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 38147#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 38150#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38164#L25-1 assume true; 38165#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38169#L25-1 assume true; 38200#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38196#L25-1 assume true; 38194#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38192#L25-1 assume true; 38187#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38185#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38179#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38176#L25-1 assume true; 38175#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38170#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38149#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38160#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 38147#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 38150#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38164#L25-1 assume true; 38165#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38169#L25-1 assume true; 38200#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38196#L25-1 assume true; 38194#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38192#L25-1 assume true; 38187#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38185#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38179#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38176#L25-1 assume true; 38175#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38170#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38149#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38160#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 38147#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 38150#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38164#L25-1 assume true; 38165#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38169#L25-1 assume true; 38200#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38196#L25-1 assume true; 38194#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38192#L25-1 assume true; 38187#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38185#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38179#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38176#L25-1 assume true; 38175#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38170#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38149#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38160#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 38147#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 38150#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38164#L25-1 assume true; 38165#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38169#L25-1 assume true; 38200#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38196#L25-1 assume true; 38194#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38192#L25-1 assume true; 38187#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38185#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38179#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38176#L25-1 assume true; 38175#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38170#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38149#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38160#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 38147#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 38151#L41-1 assume true; 38167#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38173#L41-1 assume true; 38206#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38205#L41-1 assume true; 38204#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38203#L41-1 assume true; 38202#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38201#L41-1 assume true; 38199#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38198#L41-1 assume true; 38193#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38190#L41-1 assume true; 38189#func_to_recursive_line_24_to_25_0EXIT >#84#return; 38171#L67-1 call #t~mem11 := read~int#2(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 38144#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 38146#$Ultimate##0 ~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~mem10 := read~int#2(~b.base, ~b.offset, 4); 38166#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~c.base, ~c.offset, 4); 38148#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38160#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 38147#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 38150#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38164#L25-1 assume true; 38165#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38169#L25-1 assume true; 38200#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38196#L25-1 assume true; 38194#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38192#L25-1 assume true; 38187#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38185#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38179#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38176#L25-1 assume true; 38175#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38170#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38149#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38160#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 38147#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 38150#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38164#L25-1 assume true; 38165#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38169#L25-1 assume true; 38200#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38196#L25-1 assume true; 38194#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38192#L25-1 assume true; 38187#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38185#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38179#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38176#L25-1 assume true; 38175#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38170#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38149#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38160#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 38147#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 38150#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38164#L25-1 assume true; 38165#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38169#L25-1 assume true; 38200#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38196#L25-1 assume true; 38194#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38192#L25-1 assume true; 38187#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38185#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38179#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38176#L25-1 assume true; 38175#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38170#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38149#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38160#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 38147#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 38150#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38164#L25-1 assume true; 38165#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38169#L25-1 assume true; 38200#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38196#L25-1 assume true; 38194#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38192#L25-1 assume true; 38187#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38185#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38179#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38176#L25-1 assume true; 38175#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38170#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38149#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38160#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 38147#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 38150#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38164#L25-1 assume true; 38165#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38169#L25-1 assume true; 38200#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38196#L25-1 assume true; 38194#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38192#L25-1 assume true; 38187#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38185#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38179#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38176#L25-1 assume true; 38175#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38170#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38149#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38160#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 38147#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 38150#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 38161#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 38162#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 38174#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 38164#L25-1 assume true; 38165#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38169#L25-1 assume true; 38200#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38196#L25-1 assume true; 38194#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38192#L25-1 assume true; 38187#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38185#L25-1 assume true; 38183#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38181#L25-1 assume true; 38179#func_to_recursive_line_25_to_25_0EXIT >#92#return; 38176#L25-1 assume true; 38175#func_to_recursive_line_25_to_25_0EXIT >#80#return; 38170#L47-1 call #t~mem8 := read~int#1(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 38149#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 38160#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#1(~c.base, ~c.offset, 4); 38147#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 38151#L41-1 assume true; 38167#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38173#L41-1 assume true; 38206#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38205#L41-1 assume true; 38204#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38203#L41-1 assume true; 38202#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38201#L41-1 assume true; 38199#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38198#L41-1 assume true; 38193#func_to_recursive_line_24_to_25_0EXIT >#82#return; 38190#L41-1 assume true; 38189#func_to_recursive_line_24_to_25_0EXIT >#84#return; 38171#L67-1 call #t~mem11 := read~int#2(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 38144#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 38146#$Ultimate##0 ~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~mem10 := read~int#2(~b.base, ~b.offset, 4); 38166#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 38168#L61-1 assume true; 38157#func_to_recursive_line_23_to_24_0EXIT >#86#return; 38152#L61-1 assume true; 38153#func_to_recursive_line_23_to_24_0EXIT >#86#return; 38197#L61-1 assume true; 38195#func_to_recursive_line_23_to_24_0EXIT >#86#return; 38191#L61-1 assume true; 38188#func_to_recursive_line_23_to_24_0EXIT >#86#return; 38186#L61-1 assume true; 38184#func_to_recursive_line_23_to_24_0EXIT >#86#return; 38182#L61-1 assume true; 38180#func_to_recursive_line_23_to_24_0EXIT >#86#return; 38178#L61-1 assume true; 38177#func_to_recursive_line_23_to_24_0EXIT >#88#return; 38163#L87-1 call #t~mem14 := read~int#3(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 38154#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 38156#$Ultimate##0 [2024-11-08 00:35:11,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:35:11,898 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 12 times [2024-11-08 00:35:11,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:35:11,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715059248] [2024-11-08 00:35:11,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:35:11,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:35:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:35:11,908 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:35:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:35:11,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:35:11,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:35:11,916 INFO L85 PathProgramCache]: Analyzing trace with hash 815036130, now seen corresponding path program 9 times [2024-11-08 00:35:11,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:35:11,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581405478] [2024-11-08 00:35:11,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:35:11,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:35:12,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:35:12,735 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:35:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:35:13,564 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 00:35:13,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 00:35:13,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1469748745, now seen corresponding path program 1 times [2024-11-08 00:35:13,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 00:35:13,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870486384] [2024-11-08 00:35:13,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 00:35:13,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 00:35:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:35:14,407 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 00:35:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 00:35:15,656 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace