./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 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 45898d4df949634911027a72c0e1c79e1edaab63547cca5c16238cef1218e556 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 23:18:48,209 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 23:18:48,260 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-10 23:18:48,266 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 23:18:48,267 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 23:18:48,267 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-10 23:18:48,286 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 23:18:48,287 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 23:18:48,287 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 23:18:48,288 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 23:18:48,288 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 23:18:48,288 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 23:18:48,289 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 23:18:48,290 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 23:18:48,291 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-10 23:18:48,291 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-10 23:18:48,291 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-10 23:18:48,291 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-10 23:18:48,291 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-10 23:18:48,291 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-10 23:18:48,292 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 23:18:48,294 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-10 23:18:48,294 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 23:18:48,295 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 23:18:48,295 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 23:18:48,295 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 23:18:48,295 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-10 23:18:48,295 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-10 23:18:48,295 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-10 23:18:48,296 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 23:18:48,296 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 23:18:48,296 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 23:18:48,296 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 23:18:48,296 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-10 23:18:48,296 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 23:18:48,296 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 23:18:48,296 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 23:18:48,297 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 23:18:48,297 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 23:18:48,297 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-10 23:18:48,297 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 45898d4df949634911027a72c0e1c79e1edaab63547cca5c16238cef1218e556 [2024-11-10 23:18:48,488 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 23:18:48,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 23:18:48,508 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 23:18:48,508 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 23:18:48,509 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 23:18:48,510 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c [2024-11-10 23:18:49,707 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 23:18:49,840 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 23:18:49,841 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c [2024-11-10 23:18:49,847 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a01860949/c572d4bad9a94bd69c07b57d9f4a4347/FLAGe5814b37b [2024-11-10 23:18:50,260 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a01860949/c572d4bad9a94bd69c07b57d9f4a4347 [2024-11-10 23:18:50,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 23:18:50,264 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 23:18:50,265 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 23:18:50,265 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 23:18:50,269 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 23:18:50,269 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:18:50" (1/1) ... [2024-11-10 23:18:50,270 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76e571a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:18:50, skipping insertion in model container [2024-11-10 23:18:50,270 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:18:50" (1/1) ... [2024-11-10 23:18:50,288 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 23:18:50,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 23:18:50,497 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 23:18:50,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 23:18:50,524 INFO L204 MainTranslator]: Completed translation [2024-11-10 23:18:50,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:18:50 WrapperNode [2024-11-10 23:18:50,524 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 23:18:50,525 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 23:18:50,525 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 23:18:50,526 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 23:18:50,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:18:50" (1/1) ... [2024-11-10 23:18:50,538 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:18:50" (1/1) ... [2024-11-10 23:18:50,552 INFO L138 Inliner]: procedures = 15, calls = 52, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2024-11-10 23:18:50,554 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 23:18:50,554 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 23:18:50,554 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 23:18:50,554 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 23:18:50,562 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:18:50" (1/1) ... [2024-11-10 23:18:50,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:18:50" (1/1) ... [2024-11-10 23:18:50,566 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:18:50" (1/1) ... [2024-11-10 23:18:50,582 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-10 23:18:50,584 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:18:50" (1/1) ... [2024-11-10 23:18:50,584 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:18:50" (1/1) ... [2024-11-10 23:18:50,588 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:18:50" (1/1) ... [2024-11-10 23:18:50,592 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:18:50" (1/1) ... [2024-11-10 23:18:50,594 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:18:50" (1/1) ... [2024-11-10 23:18:50,595 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:18:50" (1/1) ... [2024-11-10 23:18:50,597 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 23:18:50,597 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 23:18:50,597 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 23:18:50,597 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 23:18:50,598 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:18:50" (1/1) ... [2024-11-10 23:18:50,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:18:50,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:18:50,630 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:18:50,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-10 23:18:50,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 23:18:50,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 23:18:50,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 23:18:50,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 23:18:50,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-10 23:18:50,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-10 23:18:50,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 23:18:50,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 23:18:50,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 23:18:50,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 23:18:50,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-10 23:18:50,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-10 23:18:50,670 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2024-11-10 23:18:50,670 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2024-11-10 23:18:50,670 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2024-11-10 23:18:50,670 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2024-11-10 23:18:50,670 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_22_to_23_0 [2024-11-10 23:18:50,670 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_22_to_23_0 [2024-11-10 23:18:50,671 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_25_0 [2024-11-10 23:18:50,671 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_25_0 [2024-11-10 23:18:50,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 23:18:50,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 23:18:50,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 23:18:50,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 23:18:50,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 23:18:50,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-10 23:18:50,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-10 23:18:50,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 23:18:50,744 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 23:18:50,749 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 23:18:50,900 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset;call ULTIMATE.dealloc(main_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~0#1.offset;call ULTIMATE.dealloc(main_~#c~0#1.base, main_~#c~0#1.offset);havoc main_~#c~0#1.base, main_~#c~0#1.offset;call ULTIMATE.dealloc(main_~#d~0#1.base, main_~#d~0#1.offset);havoc main_~#d~0#1.base, main_~#d~0#1.offset; [2024-11-10 23:18:50,915 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-10 23:18:50,915 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 23:18:50,928 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 23:18:50,928 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 23:18:50,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 11:18:50 BoogieIcfgContainer [2024-11-10 23:18:50,928 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 23:18:50,929 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-10 23:18:50,929 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-10 23:18:50,932 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-10 23:18:50,932 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 23:18:50,932 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 11:18:50" (1/3) ... [2024-11-10 23:18:50,933 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@445d1d6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:18:50, skipping insertion in model container [2024-11-10 23:18:50,933 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 23:18:50,933 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:18:50" (2/3) ... [2024-11-10 23:18:50,935 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@445d1d6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:18:50, skipping insertion in model container [2024-11-10 23:18:50,935 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 23:18:50,935 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 11:18:50" (3/3) ... [2024-11-10 23:18:50,936 INFO L332 chiAutomizerObserver]: Analyzing ICFG recursified_nested_4.c [2024-11-10 23:18:50,976 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-10 23:18:50,976 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-10 23:18:50,976 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-10 23:18:50,977 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-10 23:18:50,977 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-10 23:18:50,977 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-10 23:18:50,977 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-10 23:18:50,977 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-10 23:18:50,980 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-10 23:18:50,997 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-10 23:18:50,997 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:18:50,998 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:18:51,003 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-10 23:18:51,003 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:18:51,003 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-10 23:18:51,004 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-10 23:18:51,008 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-10 23:18:51,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:18:51,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:18:51,009 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-10 23:18:51,009 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:18:51,013 INFO L745 eck$LassoCheckResult]: Stem: 22#ULTIMATE.startENTRYtrue 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); 32#ULTIMATE.init_returnLabel#1true assume true;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#1(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#4(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#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 24#L107-1true 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);< 17#func_to_recursive_line_22_to_23_0ENTRYtrue [2024-11-10 23:18:51,013 INFO L747 eck$LassoCheckResult]: Loop: 17#func_to_recursive_line_22_to_23_0ENTRYtrue ~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#1(~a.base, ~a.offset, 4); 9#L81true assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~b.base, ~b.offset, 4); 14#L87-1true call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 41#func_to_recursive_line_23_to_24_0ENTRYtrue ~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#4(~b.base, ~b.offset, 4); 20#L61true assume !(#t~mem10 < 6);havoc #t~mem10; 4#func_to_recursive_line_23_to_24_0FINALtrue assume true; 8#func_to_recursive_line_23_to_24_0EXITtrue >#57#return; 18#L87true call #t~mem14 := read~int#1(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(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);< 17#func_to_recursive_line_22_to_23_0ENTRYtrue [2024-11-10 23:18:51,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:18:51,021 INFO L85 PathProgramCache]: Analyzing trace with hash 73468, now seen corresponding path program 1 times [2024-11-10 23:18:51,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:18:51,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219480657] [2024-11-10 23:18:51,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:18:51,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:18:51,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:18:51,139 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:18:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:18:51,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:18:51,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:18:51,185 INFO L85 PathProgramCache]: Analyzing trace with hash -2100655605, now seen corresponding path program 1 times [2024-11-10 23:18:51,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:18:51,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357295560] [2024-11-10 23:18:51,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:18:51,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:18:51,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:51,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:18:51,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:51,485 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-10 23:18:51,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:18:51,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357295560] [2024-11-10 23:18:51,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357295560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 23:18:51,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 23:18:51,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 23:18:51,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55535085] [2024-11-10 23:18:51,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 23:18:51,490 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:18:51,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:18:51,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 23:18:51,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 23:18:51,519 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-10 23:18:51,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:18:51,689 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2024-11-10 23:18:51,690 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 61 transitions. [2024-11-10 23:18:51,695 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-10 23:18:51,701 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 33 states and 41 transitions. [2024-11-10 23:18:51,702 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2024-11-10 23:18:51,702 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2024-11-10 23:18:51,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2024-11-10 23:18:51,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:18:51,704 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 41 transitions. [2024-11-10 23:18:51,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2024-11-10 23:18:51,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2024-11-10 23:18:51,723 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-10 23:18:51,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-11-10 23:18:51,725 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-11-10 23:18:51,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 23:18:51,729 INFO L425 stractBuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-11-10 23:18:51,729 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-10 23:18:51,729 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2024-11-10 23:18:51,731 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-10 23:18:51,731 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:18:51,731 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:18:51,732 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-10 23:18:51,733 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-10 23:18:51,733 INFO L745 eck$LassoCheckResult]: Stem: 133#ULTIMATE.startENTRY 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); 134#ULTIMATE.init_returnLabel#1 assume true;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#1(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#4(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#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 120#L107-1 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#func_to_recursive_line_22_to_23_0ENTRY [2024-11-10 23:18:51,733 INFO L747 eck$LassoCheckResult]: Loop: 121#func_to_recursive_line_22_to_23_0ENTRY ~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#1(~a.base, ~a.offset, 4); 123#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~b.base, ~b.offset, 4); 110#L87-1 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 113#func_to_recursive_line_23_to_24_0ENTRY ~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#4(~b.base, ~b.offset, 4); 132#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 116#L67-1 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 128#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 114#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 118#func_to_recursive_line_24_to_25_0FINAL assume true; 124#func_to_recursive_line_24_to_25_0EXIT >#53#return; 131#L67 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 111#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 113#func_to_recursive_line_23_to_24_0ENTRY ~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#4(~b.base, ~b.offset, 4); 132#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 109#func_to_recursive_line_23_to_24_0FINAL assume true; 112#func_to_recursive_line_23_to_24_0EXIT >#51#return; 122#func_to_recursive_line_23_to_24_0FINAL assume true; 137#func_to_recursive_line_23_to_24_0EXIT >#57#return; 130#L87 call #t~mem14 := read~int#1(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(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#func_to_recursive_line_22_to_23_0ENTRY [2024-11-10 23:18:51,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:18:51,734 INFO L85 PathProgramCache]: Analyzing trace with hash 73468, now seen corresponding path program 2 times [2024-11-10 23:18:51,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:18:51,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458867522] [2024-11-10 23:18:51,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:18:51,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:18:51,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:18:51,752 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:18:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:18:51,769 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:18:51,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:18:51,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1206602643, now seen corresponding path program 1 times [2024-11-10 23:18:51,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:18:51,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254256145] [2024-11-10 23:18:51,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:18:51,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:18:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:51,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:18:51,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:51,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:18:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:52,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 23:18:52,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:52,043 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-10 23:18:52,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:18:52,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254256145] [2024-11-10 23:18:52,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254256145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 23:18:52,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 23:18:52,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 23:18:52,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56220420] [2024-11-10 23:18:52,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 23:18:52,045 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:18:52,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:18:52,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 23:18:52,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 23:18:52,046 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-10 23:18:52,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:18:52,159 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2024-11-10 23:18:52,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 40 transitions. [2024-11-10 23:18:52,161 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-10 23:18:52,163 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 40 transitions. [2024-11-10 23:18:52,163 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2024-11-10 23:18:52,163 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2024-11-10 23:18:52,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 40 transitions. [2024-11-10 23:18:52,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:18:52,164 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 40 transitions. [2024-11-10 23:18:52,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 40 transitions. [2024-11-10 23:18:52,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2024-11-10 23:18:52,166 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-10 23:18:52,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-11-10 23:18:52,166 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-11-10 23:18:52,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 23:18:52,167 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-11-10 23:18:52,167 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-10 23:18:52,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2024-11-10 23:18:52,168 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-10 23:18:52,168 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:18:52,168 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:18:52,169 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-10 23:18:52,170 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-10 23:18:52,170 INFO L745 eck$LassoCheckResult]: Stem: 232#ULTIMATE.startENTRY 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); 233#ULTIMATE.init_returnLabel#1 assume true;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#1(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#4(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#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 219#L107-1 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#func_to_recursive_line_22_to_23_0ENTRY [2024-11-10 23:18:52,170 INFO L747 eck$LassoCheckResult]: Loop: 220#func_to_recursive_line_22_to_23_0ENTRY ~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#1(~a.base, ~a.offset, 4); 222#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~b.base, ~b.offset, 4); 209#L87-1 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 210#func_to_recursive_line_23_to_24_0ENTRY ~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#4(~b.base, ~b.offset, 4); 231#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 215#L67-1 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 227#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 213#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 216#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 228#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 235#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 223#func_to_recursive_line_25_to_25_0FINAL assume true; 225#func_to_recursive_line_25_to_25_0EXIT >#49#return; 234#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 214#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 227#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 213#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 217#func_to_recursive_line_24_to_25_0FINAL assume true; 226#func_to_recursive_line_24_to_25_0EXIT >#47#return; 236#func_to_recursive_line_24_to_25_0FINAL assume true; 238#func_to_recursive_line_24_to_25_0EXIT >#53#return; 230#L67 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(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#func_to_recursive_line_23_to_24_0ENTRY ~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#4(~b.base, ~b.offset, 4); 231#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 211#func_to_recursive_line_23_to_24_0FINAL assume true; 212#func_to_recursive_line_23_to_24_0EXIT >#51#return; 221#func_to_recursive_line_23_to_24_0FINAL assume true; 237#func_to_recursive_line_23_to_24_0EXIT >#57#return; 229#L87 call #t~mem14 := read~int#1(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(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#func_to_recursive_line_22_to_23_0ENTRY [2024-11-10 23:18:52,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:18:52,170 INFO L85 PathProgramCache]: Analyzing trace with hash 73468, now seen corresponding path program 3 times [2024-11-10 23:18:52,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:18:52,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379276338] [2024-11-10 23:18:52,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:18:52,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:18:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:18:52,184 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:18:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:18:52,195 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:18:52,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:18:52,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1018977426, now seen corresponding path program 1 times [2024-11-10 23:18:52,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:18:52,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958440846] [2024-11-10 23:18:52,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:18:52,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:18:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:52,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:18:52,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:52,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:18:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:52,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:18:52,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:52,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 23:18:52,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:52,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 23:18:52,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:52,549 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-10 23:18:52,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:18:52,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958440846] [2024-11-10 23:18:52,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958440846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 23:18:52,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 23:18:52,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 23:18:52,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256504675] [2024-11-10 23:18:52,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 23:18:52,551 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:18:52,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:18:52,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 23:18:52,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-10 23:18:52,552 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-10 23:18:52,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:18:52,643 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2024-11-10 23:18:52,643 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 39 transitions. [2024-11-10 23:18:52,644 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-10 23:18:52,645 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 39 transitions. [2024-11-10 23:18:52,646 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2024-11-10 23:18:52,646 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2024-11-10 23:18:52,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 39 transitions. [2024-11-10 23:18:52,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:18:52,647 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-11-10 23:18:52,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 39 transitions. [2024-11-10 23:18:52,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-10 23:18:52,651 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-10 23:18:52,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2024-11-10 23:18:52,652 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-11-10 23:18:52,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 23:18:52,657 INFO L425 stractBuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-11-10 23:18:52,657 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-10 23:18:52,657 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 39 transitions. [2024-11-10 23:18:52,657 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-10 23:18:52,657 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:18:52,657 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:18:52,658 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-10 23:18:52,658 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-10 23:18:52,658 INFO L745 eck$LassoCheckResult]: Stem: 364#ULTIMATE.startENTRY 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); 365#ULTIMATE.init_returnLabel#1 assume true;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#1(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#4(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#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 351#L107-1 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#func_to_recursive_line_22_to_23_0ENTRY [2024-11-10 23:18:52,658 INFO L747 eck$LassoCheckResult]: Loop: 352#func_to_recursive_line_22_to_23_0ENTRY ~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#1(~a.base, ~a.offset, 4); 354#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~b.base, ~b.offset, 4); 341#L87-1 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 342#func_to_recursive_line_23_to_24_0ENTRY ~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#4(~b.base, ~b.offset, 4); 363#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 346#L67-1 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 359#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 345#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 348#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 360#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 367#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 356#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 360#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 367#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 355#func_to_recursive_line_25_to_25_0FINAL assume true; 357#func_to_recursive_line_25_to_25_0EXIT >#59#return; 366#func_to_recursive_line_25_to_25_0FINAL assume true; 370#func_to_recursive_line_25_to_25_0EXIT >#49#return; 369#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 347#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 359#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 345#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 349#func_to_recursive_line_24_to_25_0FINAL assume true; 358#func_to_recursive_line_24_to_25_0EXIT >#47#return; 368#func_to_recursive_line_24_to_25_0FINAL assume true; 372#func_to_recursive_line_24_to_25_0EXIT >#53#return; 362#L67 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(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#func_to_recursive_line_23_to_24_0ENTRY ~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#4(~b.base, ~b.offset, 4); 363#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 343#func_to_recursive_line_23_to_24_0FINAL assume true; 344#func_to_recursive_line_23_to_24_0EXIT >#51#return; 353#func_to_recursive_line_23_to_24_0FINAL assume true; 371#func_to_recursive_line_23_to_24_0EXIT >#57#return; 361#L87 call #t~mem14 := read~int#1(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(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#func_to_recursive_line_22_to_23_0ENTRY [2024-11-10 23:18:52,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:18:52,658 INFO L85 PathProgramCache]: Analyzing trace with hash 73468, now seen corresponding path program 4 times [2024-11-10 23:18:52,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:18:52,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473360466] [2024-11-10 23:18:52,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:18:52,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:18:52,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:18:52,668 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:18:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:18:52,673 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:18:52,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:18:52,674 INFO L85 PathProgramCache]: Analyzing trace with hash -800542714, now seen corresponding path program 1 times [2024-11-10 23:18:52,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:18:52,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990919750] [2024-11-10 23:18:52,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:18:52,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:18:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:52,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:18:52,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:53,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:18:53,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:53,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:18:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:53,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:18:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:53,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 23:18:53,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:53,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 23:18:53,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:53,218 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-10 23:18:53,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:18:53,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990919750] [2024-11-10 23:18:53,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990919750] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 23:18:53,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339815806] [2024-11-10 23:18:53,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:18:53,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 23:18:53,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:18:53,223 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 23:18:53,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 23:18:53,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:53,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-10 23:18:53,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:18:53,361 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-10 23:18:53,514 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-10 23:18:53,514 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 23:18:54,019 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-10 23:18:54,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339815806] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 23:18:54,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 23:18:54,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 22 [2024-11-10 23:18:54,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120592970] [2024-11-10 23:18:54,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 23:18:54,023 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:18:54,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:18:54,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-10 23:18:54,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2024-11-10 23:18:54,025 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. cyclomatic complexity: 10 Second operand has 22 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 7 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (12), 3 states have call predecessors, (12), 7 states have call successors, (12) [2024-11-10 23:18:54,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:18:54,257 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2024-11-10 23:18:54,258 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 41 transitions. [2024-11-10 23:18:54,258 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-10 23:18:54,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 41 transitions. [2024-11-10 23:18:54,259 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2024-11-10 23:18:54,259 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2024-11-10 23:18:54,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 41 transitions. [2024-11-10 23:18:54,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:18:54,260 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-11-10 23:18:54,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 41 transitions. [2024-11-10 23:18:54,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-10 23:18:54,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 20 states have (on average 1.15) internal successors, (23), 23 states have internal predecessors, (23), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2024-11-10 23:18:54,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-11-10 23:18:54,267 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-11-10 23:18:54,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 23:18:54,267 INFO L425 stractBuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-11-10 23:18:54,269 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-10 23:18:54,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 41 transitions. [2024-11-10 23:18:54,269 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-10 23:18:54,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:18:54,269 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:18:54,270 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-10 23:18:54,271 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:18:54,272 INFO L745 eck$LassoCheckResult]: Stem: 747#ULTIMATE.startENTRY 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); 748#ULTIMATE.init_returnLabel#1 assume true;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#1(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#4(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#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 734#L107-1 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);< 735#func_to_recursive_line_22_to_23_0ENTRY [2024-11-10 23:18:54,272 INFO L747 eck$LassoCheckResult]: Loop: 735#func_to_recursive_line_22_to_23_0ENTRY ~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#1(~a.base, ~a.offset, 4); 737#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~b.base, ~b.offset, 4); 724#L87-1 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 725#func_to_recursive_line_23_to_24_0ENTRY ~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#4(~b.base, ~b.offset, 4); 746#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 729#L67-1 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 742#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 728#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 731#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 743#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 750#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 739#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 743#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 750#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 739#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 743#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 750#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 738#func_to_recursive_line_25_to_25_0FINAL assume true; 740#func_to_recursive_line_25_to_25_0EXIT >#59#return; 749#func_to_recursive_line_25_to_25_0FINAL assume true; 755#func_to_recursive_line_25_to_25_0EXIT >#59#return; 754#func_to_recursive_line_25_to_25_0FINAL assume true; 753#func_to_recursive_line_25_to_25_0EXIT >#49#return; 752#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 730#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 742#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 728#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 732#func_to_recursive_line_24_to_25_0FINAL assume true; 741#func_to_recursive_line_24_to_25_0EXIT >#47#return; 751#func_to_recursive_line_24_to_25_0FINAL assume true; 757#func_to_recursive_line_24_to_25_0EXIT >#53#return; 745#L67 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 723#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 725#func_to_recursive_line_23_to_24_0ENTRY ~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#4(~b.base, ~b.offset, 4); 746#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 726#func_to_recursive_line_23_to_24_0FINAL assume true; 727#func_to_recursive_line_23_to_24_0EXIT >#51#return; 736#func_to_recursive_line_23_to_24_0FINAL assume true; 756#func_to_recursive_line_23_to_24_0EXIT >#57#return; 744#L87 call #t~mem14 := read~int#1(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 733#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);< 735#func_to_recursive_line_22_to_23_0ENTRY [2024-11-10 23:18:54,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:18:54,272 INFO L85 PathProgramCache]: Analyzing trace with hash 73468, now seen corresponding path program 5 times [2024-11-10 23:18:54,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:18:54,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726552079] [2024-11-10 23:18:54,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:18:54,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:18:54,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:18:54,282 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:18:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:18:54,290 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:18:54,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:18:54,291 INFO L85 PathProgramCache]: Analyzing trace with hash -2003824298, now seen corresponding path program 2 times [2024-11-10 23:18:54,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:18:54,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518468563] [2024-11-10 23:18:54,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:18:54,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:18:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:54,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:18:54,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:54,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:18:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:54,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:18:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:54,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:18:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:54,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:18:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:55,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 23:18:55,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:55,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 23:18:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:55,035 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 23:18:55,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:18:55,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518468563] [2024-11-10 23:18:55,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518468563] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 23:18:55,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382022669] [2024-11-10 23:18:55,036 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 23:18:55,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 23:18:55,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:18:55,060 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 23:18:55,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 23:18:55,156 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 23:18:55,157 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 23:18:55,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-10 23:18:55,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:18:55,174 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-10 23:18:55,383 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 23:18:55,384 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 23:18:56,155 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 23:18:56,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382022669] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 23:18:56,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 23:18:56,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 14] total 31 [2024-11-10 23:18:56,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940391275] [2024-11-10 23:18:56,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 23:18:56,156 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:18:56,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:18:56,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-10 23:18:56,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=754, Unknown=0, NotChecked=0, Total=930 [2024-11-10 23:18:56,157 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. cyclomatic complexity: 10 Second operand has 31 states, 23 states have (on average 2.0) internal successors, (46), 25 states have internal predecessors, (46), 10 states have call successors, (19), 8 states have call predecessors, (19), 9 states have return successors, (15), 6 states have call predecessors, (15), 10 states have call successors, (15) [2024-11-10 23:18:56,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:18:56,441 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2024-11-10 23:18:56,441 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 45 transitions. [2024-11-10 23:18:56,442 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-10 23:18:56,442 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 45 transitions. [2024-11-10 23:18:56,443 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2024-11-10 23:18:56,443 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2024-11-10 23:18:56,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 45 transitions. [2024-11-10 23:18:56,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:18:56,443 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 45 transitions. [2024-11-10 23:18:56,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 45 transitions. [2024-11-10 23:18:56,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-10 23:18:56,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 25 states have internal predecessors, (25), 8 states have call successors, (8), 4 states have call predecessors, (8), 9 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-10 23:18:56,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2024-11-10 23:18:56,447 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 45 transitions. [2024-11-10 23:18:56,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 23:18:56,449 INFO L425 stractBuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2024-11-10 23:18:56,449 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-10 23:18:56,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 45 transitions. [2024-11-10 23:18:56,450 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-10 23:18:56,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:18:56,450 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:18:56,451 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-10 23:18:56,451 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 5, 4, 4, 4, 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-10 23:18:56,451 INFO L745 eck$LassoCheckResult]: Stem: 1203#ULTIMATE.startENTRY 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); 1204#ULTIMATE.init_returnLabel#1 assume true;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#1(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#4(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#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 1190#L107-1 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);< 1191#func_to_recursive_line_22_to_23_0ENTRY [2024-11-10 23:18:56,451 INFO L747 eck$LassoCheckResult]: Loop: 1191#func_to_recursive_line_22_to_23_0ENTRY ~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#1(~a.base, ~a.offset, 4); 1193#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~b.base, ~b.offset, 4); 1180#L87-1 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1181#func_to_recursive_line_23_to_24_0ENTRY ~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#4(~b.base, ~b.offset, 4); 1202#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 1185#L67-1 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 1198#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 1184#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 1187#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1199#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1206#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1195#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1199#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1206#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1195#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1199#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1206#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1195#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1199#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1206#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1195#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1199#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1206#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1194#func_to_recursive_line_25_to_25_0FINAL assume true; 1196#func_to_recursive_line_25_to_25_0EXIT >#59#return; 1205#func_to_recursive_line_25_to_25_0FINAL assume true; 1215#func_to_recursive_line_25_to_25_0EXIT >#59#return; 1214#func_to_recursive_line_25_to_25_0FINAL assume true; 1213#func_to_recursive_line_25_to_25_0EXIT >#59#return; 1212#func_to_recursive_line_25_to_25_0FINAL assume true; 1211#func_to_recursive_line_25_to_25_0EXIT >#59#return; 1210#func_to_recursive_line_25_to_25_0FINAL assume true; 1209#func_to_recursive_line_25_to_25_0EXIT >#49#return; 1208#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 1186#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 1198#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 1184#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1188#func_to_recursive_line_24_to_25_0FINAL assume true; 1197#func_to_recursive_line_24_to_25_0EXIT >#47#return; 1207#func_to_recursive_line_24_to_25_0FINAL assume true; 1217#func_to_recursive_line_24_to_25_0EXIT >#53#return; 1201#L67 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 1179#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1181#func_to_recursive_line_23_to_24_0ENTRY ~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#4(~b.base, ~b.offset, 4); 1202#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1182#func_to_recursive_line_23_to_24_0FINAL assume true; 1183#func_to_recursive_line_23_to_24_0EXIT >#51#return; 1192#func_to_recursive_line_23_to_24_0FINAL assume true; 1216#func_to_recursive_line_23_to_24_0EXIT >#57#return; 1200#L87 call #t~mem14 := read~int#1(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 1189#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);< 1191#func_to_recursive_line_22_to_23_0ENTRY [2024-11-10 23:18:56,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:18:56,451 INFO L85 PathProgramCache]: Analyzing trace with hash 73468, now seen corresponding path program 6 times [2024-11-10 23:18:56,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:18:56,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611721223] [2024-11-10 23:18:56,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:18:56,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:18:56,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:18:56,463 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:18:56,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:18:56,469 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:18:56,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:18:56,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1187337242, now seen corresponding path program 3 times [2024-11-10 23:18:56,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:18:56,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266941139] [2024-11-10 23:18:56,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:18:56,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:18:56,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:56,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:18:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:57,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:18:57,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:57,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:18:57,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:57,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:18:57,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:57,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:18:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:57,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:18:57,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:57,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:18:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:57,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 23:18:57,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:57,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 23:18:57,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:57,765 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-10 23:18:57,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:18:57,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266941139] [2024-11-10 23:18:57,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266941139] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 23:18:57,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047100005] [2024-11-10 23:18:57,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 23:18:57,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 23:18:57,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:18:57,768 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 23:18:57,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 23:18:57,846 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-10 23:18:57,847 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 23:18:57,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-10 23:18:57,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:18:57,856 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-10 23:18:57,986 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-10 23:18:57,988 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 23:18:58,348 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-10 23:18:58,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047100005] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 23:18:58,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 23:18:58,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 10] total 31 [2024-11-10 23:18:58,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996138956] [2024-11-10 23:18:58,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 23:18:58,349 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:18:58,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:18:58,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-10 23:18:58,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=813, Unknown=0, NotChecked=0, Total=930 [2024-11-10 23:18:58,350 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. cyclomatic complexity: 10 Second operand has 31 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 25 states have internal predecessors, (49), 11 states have call successors, (17), 8 states have call predecessors, (17), 11 states have return successors, (18), 10 states have call predecessors, (18), 11 states have call successors, (18) [2024-11-10 23:18:58,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:18:58,774 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2024-11-10 23:18:58,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 49 transitions. [2024-11-10 23:18:58,775 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-10 23:18:58,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 49 transitions. [2024-11-10 23:18:58,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2024-11-10 23:18:58,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2024-11-10 23:18:58,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 49 transitions. [2024-11-10 23:18:58,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:18:58,776 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43 states and 49 transitions. [2024-11-10 23:18:58,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 49 transitions. [2024-11-10 23:18:58,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-10 23:18:58,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.125) internal successors, (27), 27 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 11 states have return successors, (14), 11 states have call predecessors, (14), 6 states have call successors, (14) [2024-11-10 23:18:58,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2024-11-10 23:18:58,779 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 49 transitions. [2024-11-10 23:18:58,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 23:18:58,779 INFO L425 stractBuchiCegarLoop]: Abstraction has 43 states and 49 transitions. [2024-11-10 23:18:58,780 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-10 23:18:58,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 49 transitions. [2024-11-10 23:18:58,780 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-10 23:18:58,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:18:58,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:18:58,782 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-10 23:18:58,782 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 12, 10, 10, 10, 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-10 23:18:58,782 INFO L745 eck$LassoCheckResult]: Stem: 1805#ULTIMATE.startENTRY 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); 1806#ULTIMATE.init_returnLabel#1 assume true;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#1(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#4(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#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 1792#L107-1 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);< 1793#func_to_recursive_line_22_to_23_0ENTRY [2024-11-10 23:18:58,782 INFO L747 eck$LassoCheckResult]: Loop: 1793#func_to_recursive_line_22_to_23_0ENTRY ~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#1(~a.base, ~a.offset, 4); 1795#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~b.base, ~b.offset, 4); 1782#L87-1 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1785#func_to_recursive_line_23_to_24_0ENTRY ~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#4(~b.base, ~b.offset, 4); 1804#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 1787#L67-1 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 1800#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 1786#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 1789#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1801#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1808#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1798#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1801#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1808#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1798#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1801#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1808#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1798#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1801#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1808#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1798#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1801#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1808#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1798#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1801#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1808#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1797#func_to_recursive_line_25_to_25_0FINAL assume true; 1799#func_to_recursive_line_25_to_25_0EXIT >#59#return; 1807#func_to_recursive_line_25_to_25_0FINAL assume true; 1819#func_to_recursive_line_25_to_25_0EXIT >#59#return; 1818#func_to_recursive_line_25_to_25_0FINAL assume true; 1817#func_to_recursive_line_25_to_25_0EXIT >#59#return; 1816#func_to_recursive_line_25_to_25_0FINAL assume true; 1815#func_to_recursive_line_25_to_25_0EXIT >#59#return; 1814#func_to_recursive_line_25_to_25_0FINAL assume true; 1813#func_to_recursive_line_25_to_25_0EXIT >#59#return; 1812#func_to_recursive_line_25_to_25_0FINAL assume true; 1811#func_to_recursive_line_25_to_25_0EXIT >#49#return; 1810#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 1788#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 1800#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 1786#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1790#func_to_recursive_line_24_to_25_0FINAL assume true; 1796#func_to_recursive_line_24_to_25_0EXIT >#47#return; 1809#func_to_recursive_line_24_to_25_0FINAL assume true; 1823#func_to_recursive_line_24_to_25_0EXIT >#53#return; 1803#L67 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 1783#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1785#func_to_recursive_line_23_to_24_0ENTRY ~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#4(~b.base, ~b.offset, 4); 1804#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 1787#L67-1 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 1800#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 1786#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 1789#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1801#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1808#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1798#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1801#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1808#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1798#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1801#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1808#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1798#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1801#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1808#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1798#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1801#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1808#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1798#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1801#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 1808#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1797#func_to_recursive_line_25_to_25_0FINAL assume true; 1799#func_to_recursive_line_25_to_25_0EXIT >#59#return; 1807#func_to_recursive_line_25_to_25_0FINAL assume true; 1819#func_to_recursive_line_25_to_25_0EXIT >#59#return; 1818#func_to_recursive_line_25_to_25_0FINAL assume true; 1817#func_to_recursive_line_25_to_25_0EXIT >#59#return; 1816#func_to_recursive_line_25_to_25_0FINAL assume true; 1815#func_to_recursive_line_25_to_25_0EXIT >#59#return; 1814#func_to_recursive_line_25_to_25_0FINAL assume true; 1813#func_to_recursive_line_25_to_25_0EXIT >#59#return; 1812#func_to_recursive_line_25_to_25_0FINAL assume true; 1811#func_to_recursive_line_25_to_25_0EXIT >#49#return; 1810#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 1788#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 1800#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 1786#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1790#func_to_recursive_line_24_to_25_0FINAL assume true; 1796#func_to_recursive_line_24_to_25_0EXIT >#47#return; 1809#func_to_recursive_line_24_to_25_0FINAL assume true; 1823#func_to_recursive_line_24_to_25_0EXIT >#53#return; 1803#L67 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 1783#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1785#func_to_recursive_line_23_to_24_0ENTRY ~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#4(~b.base, ~b.offset, 4); 1804#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1781#func_to_recursive_line_23_to_24_0FINAL assume true; 1784#func_to_recursive_line_23_to_24_0EXIT >#51#return; 1794#func_to_recursive_line_23_to_24_0FINAL assume true; 1822#func_to_recursive_line_23_to_24_0EXIT >#51#return; 1821#func_to_recursive_line_23_to_24_0FINAL assume true; 1820#func_to_recursive_line_23_to_24_0EXIT >#57#return; 1802#L87 call #t~mem14 := read~int#1(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 1791#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);< 1793#func_to_recursive_line_22_to_23_0ENTRY [2024-11-10 23:18:58,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:18:58,783 INFO L85 PathProgramCache]: Analyzing trace with hash 73468, now seen corresponding path program 7 times [2024-11-10 23:18:58,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:18:58,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492711543] [2024-11-10 23:18:58,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:18:58,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:18:58,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:18:58,789 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:18:58,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:18:58,793 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:18:58,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:18:58,793 INFO L85 PathProgramCache]: Analyzing trace with hash -219981513, now seen corresponding path program 4 times [2024-11-10 23:18:58,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:18:58,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44681436] [2024-11-10 23:18:58,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:18:58,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:18:58,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:59,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:18:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:00,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:00,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:00,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:00,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:00,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:00,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:00,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:00,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:00,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:00,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:00,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:00,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:00,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:00,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 23:19:00,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:00,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 23:19:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:00,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:00,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:00,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:00,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:00,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:00,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:00,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:00,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:00,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:00,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:00,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:00,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:00,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:00,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 23:19:00,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:00,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 23:19:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:00,867 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 6 proven. 177 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2024-11-10 23:19:00,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:19:00,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44681436] [2024-11-10 23:19:00,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44681436] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 23:19:00,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790318543] [2024-11-10 23:19:00,868 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-10 23:19:00,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 23:19:00,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:19:00,870 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 23:19:00,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 23:19:01,019 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-10 23:19:01,019 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 23:19:01,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-10 23:19:01,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:19:01,043 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-10 23:19:01,188 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 36 treesize of output 13 [2024-11-10 23:19:01,190 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 193 proven. 3 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-11-10 23:19:01,191 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 23:19:01,753 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2024-11-10 23:19:01,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790318543] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 23:19:01,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 23:19:01,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 10] total 31 [2024-11-10 23:19:01,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135460773] [2024-11-10 23:19:01,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 23:19:01,758 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:19:01,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:19:01,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-10 23:19:01,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=806, Unknown=0, NotChecked=0, Total=930 [2024-11-10 23:19:01,759 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. cyclomatic complexity: 10 Second operand has 31 states, 25 states have (on average 2.48) internal successors, (62), 25 states have internal predecessors, (62), 10 states have call successors, (29), 8 states have call predecessors, (29), 12 states have return successors, (26), 11 states have call predecessors, (26), 10 states have call successors, (26) [2024-11-10 23:19:02,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:19:02,126 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2024-11-10 23:19:02,126 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 53 transitions. [2024-11-10 23:19:02,127 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-10 23:19:02,127 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 53 transitions. [2024-11-10 23:19:02,127 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2024-11-10 23:19:02,128 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2024-11-10 23:19:02,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 53 transitions. [2024-11-10 23:19:02,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:19:02,128 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 53 transitions. [2024-11-10 23:19:02,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 53 transitions. [2024-11-10 23:19:02,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-10 23:19:02,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 29 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 13 states have return successors, (16), 13 states have call predecessors, (16), 6 states have call successors, (16) [2024-11-10 23:19:02,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2024-11-10 23:19:02,131 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 53 transitions. [2024-11-10 23:19:02,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-10 23:19:02,132 INFO L425 stractBuchiCegarLoop]: Abstraction has 47 states and 53 transitions. [2024-11-10 23:19:02,133 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-10 23:19:02,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 53 transitions. [2024-11-10 23:19:02,133 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-10 23:19:02,133 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:19:02,133 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:19:02,136 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-10 23:19:02,136 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [28, 28, 24, 24, 24, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:19:02,136 INFO L745 eck$LassoCheckResult]: Stem: 3008#ULTIMATE.startENTRY 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); 3009#ULTIMATE.init_returnLabel#1 assume true;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#1(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#4(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#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 2995#L107-1 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);< 2996#func_to_recursive_line_22_to_23_0ENTRY [2024-11-10 23:19:02,137 INFO L747 eck$LassoCheckResult]: Loop: 2996#func_to_recursive_line_22_to_23_0ENTRY ~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#1(~a.base, ~a.offset, 4); 2998#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~b.base, ~b.offset, 4); 2985#L87-1 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2986#func_to_recursive_line_23_to_24_0ENTRY ~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#4(~b.base, ~b.offset, 4); 3007#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 2990#L67-1 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 3003#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 2989#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 2992#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3004#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3011#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3000#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3004#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3011#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3000#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3004#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3011#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3000#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3004#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3011#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3000#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3004#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3011#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3000#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3004#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3011#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3000#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3004#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3011#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2999#func_to_recursive_line_25_to_25_0FINAL assume true; 3001#func_to_recursive_line_25_to_25_0EXIT >#59#return; 3010#func_to_recursive_line_25_to_25_0FINAL assume true; 3027#func_to_recursive_line_25_to_25_0EXIT >#59#return; 3025#func_to_recursive_line_25_to_25_0FINAL assume true; 3022#func_to_recursive_line_25_to_25_0EXIT >#59#return; 3021#func_to_recursive_line_25_to_25_0FINAL assume true; 3020#func_to_recursive_line_25_to_25_0EXIT >#59#return; 3019#func_to_recursive_line_25_to_25_0FINAL assume true; 3018#func_to_recursive_line_25_to_25_0EXIT >#59#return; 3017#func_to_recursive_line_25_to_25_0FINAL assume true; 3016#func_to_recursive_line_25_to_25_0EXIT >#59#return; 3015#func_to_recursive_line_25_to_25_0FINAL assume true; 3014#func_to_recursive_line_25_to_25_0EXIT >#49#return; 3013#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 2991#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 3003#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 2989#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 2992#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3004#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3011#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3000#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3004#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3011#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3000#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3004#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3011#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3000#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3004#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3011#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3000#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3004#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3011#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3000#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3004#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3011#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3000#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3004#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3011#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2999#func_to_recursive_line_25_to_25_0FINAL assume true; 3001#func_to_recursive_line_25_to_25_0EXIT >#59#return; 3010#func_to_recursive_line_25_to_25_0FINAL assume true; 3027#func_to_recursive_line_25_to_25_0EXIT >#59#return; 3025#func_to_recursive_line_25_to_25_0FINAL assume true; 3022#func_to_recursive_line_25_to_25_0EXIT >#59#return; 3021#func_to_recursive_line_25_to_25_0FINAL assume true; 3020#func_to_recursive_line_25_to_25_0EXIT >#59#return; 3019#func_to_recursive_line_25_to_25_0FINAL assume true; 3018#func_to_recursive_line_25_to_25_0EXIT >#59#return; 3017#func_to_recursive_line_25_to_25_0FINAL assume true; 3016#func_to_recursive_line_25_to_25_0EXIT >#59#return; 3015#func_to_recursive_line_25_to_25_0FINAL assume true; 3014#func_to_recursive_line_25_to_25_0EXIT >#49#return; 3013#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 2991#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 3003#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 2989#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2993#func_to_recursive_line_24_to_25_0FINAL assume true; 3002#func_to_recursive_line_24_to_25_0EXIT >#47#return; 3012#func_to_recursive_line_24_to_25_0FINAL assume true; 3030#func_to_recursive_line_24_to_25_0EXIT >#47#return; 3029#func_to_recursive_line_24_to_25_0FINAL assume true; 3028#func_to_recursive_line_24_to_25_0EXIT >#53#return; 3006#L67 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 2984#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2986#func_to_recursive_line_23_to_24_0ENTRY ~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#4(~b.base, ~b.offset, 4); 3007#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 2990#L67-1 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 3003#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 2989#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 2992#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3004#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3011#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3000#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3004#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3011#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3000#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3004#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3011#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3000#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3004#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3011#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3000#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3004#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3011#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3000#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3004#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3011#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3000#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3004#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3011#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2999#func_to_recursive_line_25_to_25_0FINAL assume true; 3001#func_to_recursive_line_25_to_25_0EXIT >#59#return; 3010#func_to_recursive_line_25_to_25_0FINAL assume true; 3027#func_to_recursive_line_25_to_25_0EXIT >#59#return; 3025#func_to_recursive_line_25_to_25_0FINAL assume true; 3022#func_to_recursive_line_25_to_25_0EXIT >#59#return; 3021#func_to_recursive_line_25_to_25_0FINAL assume true; 3020#func_to_recursive_line_25_to_25_0EXIT >#59#return; 3019#func_to_recursive_line_25_to_25_0FINAL assume true; 3018#func_to_recursive_line_25_to_25_0EXIT >#59#return; 3017#func_to_recursive_line_25_to_25_0FINAL assume true; 3016#func_to_recursive_line_25_to_25_0EXIT >#59#return; 3015#func_to_recursive_line_25_to_25_0FINAL assume true; 3014#func_to_recursive_line_25_to_25_0EXIT >#49#return; 3013#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 2991#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 3003#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 2989#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 2992#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3004#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3011#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3000#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3004#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3011#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3000#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3004#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3011#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3000#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3004#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3011#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3000#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3004#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3011#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3000#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3004#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3011#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3000#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3004#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 3011#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2999#func_to_recursive_line_25_to_25_0FINAL assume true; 3001#func_to_recursive_line_25_to_25_0EXIT >#59#return; 3010#func_to_recursive_line_25_to_25_0FINAL assume true; 3027#func_to_recursive_line_25_to_25_0EXIT >#59#return; 3025#func_to_recursive_line_25_to_25_0FINAL assume true; 3022#func_to_recursive_line_25_to_25_0EXIT >#59#return; 3021#func_to_recursive_line_25_to_25_0FINAL assume true; 3020#func_to_recursive_line_25_to_25_0EXIT >#59#return; 3019#func_to_recursive_line_25_to_25_0FINAL assume true; 3018#func_to_recursive_line_25_to_25_0EXIT >#59#return; 3017#func_to_recursive_line_25_to_25_0FINAL assume true; 3016#func_to_recursive_line_25_to_25_0EXIT >#59#return; 3015#func_to_recursive_line_25_to_25_0FINAL assume true; 3014#func_to_recursive_line_25_to_25_0EXIT >#49#return; 3013#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 2991#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 3003#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 2989#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2993#func_to_recursive_line_24_to_25_0FINAL assume true; 3002#func_to_recursive_line_24_to_25_0EXIT >#47#return; 3012#func_to_recursive_line_24_to_25_0FINAL assume true; 3030#func_to_recursive_line_24_to_25_0EXIT >#47#return; 3029#func_to_recursive_line_24_to_25_0FINAL assume true; 3028#func_to_recursive_line_24_to_25_0EXIT >#53#return; 3006#L67 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 2984#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2986#func_to_recursive_line_23_to_24_0ENTRY ~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#4(~b.base, ~b.offset, 4); 3007#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 2987#func_to_recursive_line_23_to_24_0FINAL assume true; 2988#func_to_recursive_line_23_to_24_0EXIT >#51#return; 2997#func_to_recursive_line_23_to_24_0FINAL assume true; 3026#func_to_recursive_line_23_to_24_0EXIT >#51#return; 3024#func_to_recursive_line_23_to_24_0FINAL assume true; 3023#func_to_recursive_line_23_to_24_0EXIT >#57#return; 3005#L87 call #t~mem14 := read~int#1(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 2994#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);< 2996#func_to_recursive_line_22_to_23_0ENTRY [2024-11-10 23:19:02,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:19:02,137 INFO L85 PathProgramCache]: Analyzing trace with hash 73468, now seen corresponding path program 8 times [2024-11-10 23:19:02,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:19:02,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022693839] [2024-11-10 23:19:02,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:19:02,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:19:02,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:19:02,144 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:19:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:19:02,148 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:19:02,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:19:02,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1997276503, now seen corresponding path program 5 times [2024-11-10 23:19:02,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:19:02,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547200481] [2024-11-10 23:19:02,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:19:02,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:19:02,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:02,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:02,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:03,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:03,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:03,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:03,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:03,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:03,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:03,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:03,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:03,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:03,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:03,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:03,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:03,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:03,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:03,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:03,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:03,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:03,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:03,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:03,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:03,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:03,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:03,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:03,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:03,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:03,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:03,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 23:19:03,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:03,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:03,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:03,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:03,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:03,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:03,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:03,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:03,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:03,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:03,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:03,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:03,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:03,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:03,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:03,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:03,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:03,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:03,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:03,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:03,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:03,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:03,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:03,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:03,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:03,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:03,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:03,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:03,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:03,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:03,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:03,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:03,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:03,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 23:19:03,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:03,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1881 backedges. 4 proven. 50 refuted. 0 times theorem prover too weak. 1827 trivial. 0 not checked. [2024-11-10 23:19:03,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:19:03,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547200481] [2024-11-10 23:19:03,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547200481] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 23:19:03,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846145900] [2024-11-10 23:19:03,817 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-10 23:19:03,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 23:19:03,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:19:03,820 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 23:19:03,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 23:19:04,417 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2024-11-10 23:19:04,417 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 23:19:04,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 990 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-10 23:19:04,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:19:04,431 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-10 23:19:04,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1881 backedges. 981 proven. 8 refuted. 0 times theorem prover too weak. 892 trivial. 0 not checked. [2024-11-10 23:19:04,590 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 23:19:05,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1881 backedges. 4 proven. 66 refuted. 0 times theorem prover too weak. 1811 trivial. 0 not checked. [2024-11-10 23:19:05,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846145900] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 23:19:05,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 23:19:05,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 14] total 28 [2024-11-10 23:19:05,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172061977] [2024-11-10 23:19:05,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 23:19:05,438 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:19:05,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:19:05,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-10 23:19:05,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2024-11-10 23:19:05,439 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. cyclomatic complexity: 10 Second operand has 28 states, 22 states have (on average 2.727272727272727) internal successors, (60), 21 states have internal predecessors, (60), 11 states have call successors, (31), 9 states have call predecessors, (31), 8 states have return successors, (24), 9 states have call predecessors, (24), 11 states have call successors, (24) [2024-11-10 23:19:05,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:19:05,641 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2024-11-10 23:19:05,641 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 55 transitions. [2024-11-10 23:19:05,642 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-10 23:19:05,642 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 55 transitions. [2024-11-10 23:19:05,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2024-11-10 23:19:05,643 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2024-11-10 23:19:05,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 55 transitions. [2024-11-10 23:19:05,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:19:05,643 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 55 transitions. [2024-11-10 23:19:05,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 55 transitions. [2024-11-10 23:19:05,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-10 23:19:05,646 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-10 23:19:05,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2024-11-10 23:19:05,646 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 55 transitions. [2024-11-10 23:19:05,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 23:19:05,647 INFO L425 stractBuchiCegarLoop]: Abstraction has 49 states and 55 transitions. [2024-11-10 23:19:05,647 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-10 23:19:05,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 55 transitions. [2024-11-10 23:19:05,647 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-10 23:19:05,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:19:05,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:19:05,649 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-10 23:19:05,649 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [42, 42, 36, 36, 36, 8, 8, 6, 6, 6, 6, 6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:19:05,650 INFO L745 eck$LassoCheckResult]: Stem: 5401#ULTIMATE.startENTRY 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); 5402#ULTIMATE.init_returnLabel#1 assume true;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#1(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#4(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#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 5387#L107-1 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);< 5388#func_to_recursive_line_22_to_23_0ENTRY [2024-11-10 23:19:05,650 INFO L747 eck$LassoCheckResult]: Loop: 5388#func_to_recursive_line_22_to_23_0ENTRY ~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#1(~a.base, ~a.offset, 4); 5390#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~b.base, ~b.offset, 4); 5377#L87-1 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 5380#func_to_recursive_line_23_to_24_0ENTRY ~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#4(~b.base, ~b.offset, 4); 5400#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 5382#L67-1 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 5396#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 5381#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 5384#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5397#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 5404#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5394#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5397#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 5404#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5394#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5397#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 5404#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5394#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5397#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 5404#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5394#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5397#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 5404#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5394#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5397#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 5404#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5394#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5397#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 5404#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 5393#func_to_recursive_line_25_to_25_0FINAL assume true; 5395#func_to_recursive_line_25_to_25_0EXIT >#59#return; 5403#func_to_recursive_line_25_to_25_0FINAL assume true; 5420#func_to_recursive_line_25_to_25_0EXIT >#59#return; 5418#func_to_recursive_line_25_to_25_0FINAL assume true; 5415#func_to_recursive_line_25_to_25_0EXIT >#59#return; 5414#func_to_recursive_line_25_to_25_0FINAL assume true; 5413#func_to_recursive_line_25_to_25_0EXIT >#59#return; 5412#func_to_recursive_line_25_to_25_0FINAL assume true; 5411#func_to_recursive_line_25_to_25_0EXIT >#59#return; 5410#func_to_recursive_line_25_to_25_0FINAL assume true; 5409#func_to_recursive_line_25_to_25_0EXIT >#59#return; 5408#func_to_recursive_line_25_to_25_0FINAL assume true; 5407#func_to_recursive_line_25_to_25_0EXIT >#49#return; 5406#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 5383#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 5396#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 5381#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 5384#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5397#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 5404#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5394#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5397#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 5404#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5394#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5397#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 5404#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5394#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5397#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 5404#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5394#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5397#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 5404#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5394#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5397#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 5404#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5394#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5397#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 5404#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 5393#func_to_recursive_line_25_to_25_0FINAL assume true; 5395#func_to_recursive_line_25_to_25_0EXIT >#59#return; 5403#func_to_recursive_line_25_to_25_0FINAL assume true; 5420#func_to_recursive_line_25_to_25_0EXIT >#59#return; 5418#func_to_recursive_line_25_to_25_0FINAL assume true; 5415#func_to_recursive_line_25_to_25_0EXIT >#59#return; 5414#func_to_recursive_line_25_to_25_0FINAL assume true; 5413#func_to_recursive_line_25_to_25_0EXIT >#59#return; 5412#func_to_recursive_line_25_to_25_0FINAL assume true; 5411#func_to_recursive_line_25_to_25_0EXIT >#59#return; 5410#func_to_recursive_line_25_to_25_0FINAL assume true; 5409#func_to_recursive_line_25_to_25_0EXIT >#59#return; 5408#func_to_recursive_line_25_to_25_0FINAL assume true; 5407#func_to_recursive_line_25_to_25_0EXIT >#49#return; 5406#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 5383#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 5396#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 5381#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 5384#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5397#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 5404#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5394#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5397#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 5404#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5394#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5397#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 5404#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5394#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5397#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 5404#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5394#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5397#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 5404#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5394#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5397#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 5404#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5394#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5397#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 5404#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 5393#func_to_recursive_line_25_to_25_0FINAL assume true; 5395#func_to_recursive_line_25_to_25_0EXIT >#59#return; 5403#func_to_recursive_line_25_to_25_0FINAL assume true; 5420#func_to_recursive_line_25_to_25_0EXIT >#59#return; 5418#func_to_recursive_line_25_to_25_0FINAL assume true; 5415#func_to_recursive_line_25_to_25_0EXIT >#59#return; 5414#func_to_recursive_line_25_to_25_0FINAL assume true; 5413#func_to_recursive_line_25_to_25_0EXIT >#59#return; 5412#func_to_recursive_line_25_to_25_0FINAL assume true; 5411#func_to_recursive_line_25_to_25_0EXIT >#59#return; 5410#func_to_recursive_line_25_to_25_0FINAL assume true; 5409#func_to_recursive_line_25_to_25_0EXIT >#59#return; 5408#func_to_recursive_line_25_to_25_0FINAL assume true; 5407#func_to_recursive_line_25_to_25_0EXIT >#49#return; 5406#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 5383#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 5396#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 5381#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 5385#func_to_recursive_line_24_to_25_0FINAL assume true; 5405#func_to_recursive_line_24_to_25_0EXIT >#47#return; 5391#func_to_recursive_line_24_to_25_0FINAL assume true; 5392#func_to_recursive_line_24_to_25_0EXIT >#47#return; 5424#func_to_recursive_line_24_to_25_0FINAL assume true; 5423#func_to_recursive_line_24_to_25_0EXIT >#47#return; 5422#func_to_recursive_line_24_to_25_0FINAL assume true; 5421#func_to_recursive_line_24_to_25_0EXIT >#53#return; 5399#L67 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 5378#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 5380#func_to_recursive_line_23_to_24_0ENTRY ~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#4(~b.base, ~b.offset, 4); 5400#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 5382#L67-1 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 5396#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 5381#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 5384#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5397#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 5404#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5394#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5397#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 5404#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5394#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5397#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 5404#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5394#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5397#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 5404#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5394#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5397#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 5404#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5394#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5397#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 5404#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5394#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5397#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 5404#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 5393#func_to_recursive_line_25_to_25_0FINAL assume true; 5395#func_to_recursive_line_25_to_25_0EXIT >#59#return; 5403#func_to_recursive_line_25_to_25_0FINAL assume true; 5420#func_to_recursive_line_25_to_25_0EXIT >#59#return; 5418#func_to_recursive_line_25_to_25_0FINAL assume true; 5415#func_to_recursive_line_25_to_25_0EXIT >#59#return; 5414#func_to_recursive_line_25_to_25_0FINAL assume true; 5413#func_to_recursive_line_25_to_25_0EXIT >#59#return; 5412#func_to_recursive_line_25_to_25_0FINAL assume true; 5411#func_to_recursive_line_25_to_25_0EXIT >#59#return; 5410#func_to_recursive_line_25_to_25_0FINAL assume true; 5409#func_to_recursive_line_25_to_25_0EXIT >#59#return; 5408#func_to_recursive_line_25_to_25_0FINAL assume true; 5407#func_to_recursive_line_25_to_25_0EXIT >#49#return; 5406#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 5383#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 5396#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 5381#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 5384#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5397#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 5404#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5394#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5397#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 5404#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5394#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5397#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 5404#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5394#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5397#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 5404#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5394#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5397#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 5404#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5394#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5397#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 5404#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5394#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5397#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 5404#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 5393#func_to_recursive_line_25_to_25_0FINAL assume true; 5395#func_to_recursive_line_25_to_25_0EXIT >#59#return; 5403#func_to_recursive_line_25_to_25_0FINAL assume true; 5420#func_to_recursive_line_25_to_25_0EXIT >#59#return; 5418#func_to_recursive_line_25_to_25_0FINAL assume true; 5415#func_to_recursive_line_25_to_25_0EXIT >#59#return; 5414#func_to_recursive_line_25_to_25_0FINAL assume true; 5413#func_to_recursive_line_25_to_25_0EXIT >#59#return; 5412#func_to_recursive_line_25_to_25_0FINAL assume true; 5411#func_to_recursive_line_25_to_25_0EXIT >#59#return; 5410#func_to_recursive_line_25_to_25_0FINAL assume true; 5409#func_to_recursive_line_25_to_25_0EXIT >#59#return; 5408#func_to_recursive_line_25_to_25_0FINAL assume true; 5407#func_to_recursive_line_25_to_25_0EXIT >#49#return; 5406#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 5383#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 5396#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 5381#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 5384#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5397#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 5404#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5394#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5397#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 5404#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5394#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5397#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 5404#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5394#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5397#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 5404#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5394#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5397#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 5404#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5394#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5397#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 5404#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5394#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5397#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 5404#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 5393#func_to_recursive_line_25_to_25_0FINAL assume true; 5395#func_to_recursive_line_25_to_25_0EXIT >#59#return; 5403#func_to_recursive_line_25_to_25_0FINAL assume true; 5420#func_to_recursive_line_25_to_25_0EXIT >#59#return; 5418#func_to_recursive_line_25_to_25_0FINAL assume true; 5415#func_to_recursive_line_25_to_25_0EXIT >#59#return; 5414#func_to_recursive_line_25_to_25_0FINAL assume true; 5413#func_to_recursive_line_25_to_25_0EXIT >#59#return; 5412#func_to_recursive_line_25_to_25_0FINAL assume true; 5411#func_to_recursive_line_25_to_25_0EXIT >#59#return; 5410#func_to_recursive_line_25_to_25_0FINAL assume true; 5409#func_to_recursive_line_25_to_25_0EXIT >#59#return; 5408#func_to_recursive_line_25_to_25_0FINAL assume true; 5407#func_to_recursive_line_25_to_25_0EXIT >#49#return; 5406#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 5383#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 5396#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 5381#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 5385#func_to_recursive_line_24_to_25_0FINAL assume true; 5405#func_to_recursive_line_24_to_25_0EXIT >#47#return; 5391#func_to_recursive_line_24_to_25_0FINAL assume true; 5392#func_to_recursive_line_24_to_25_0EXIT >#47#return; 5424#func_to_recursive_line_24_to_25_0FINAL assume true; 5423#func_to_recursive_line_24_to_25_0EXIT >#47#return; 5422#func_to_recursive_line_24_to_25_0FINAL assume true; 5421#func_to_recursive_line_24_to_25_0EXIT >#53#return; 5399#L67 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 5378#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 5380#func_to_recursive_line_23_to_24_0ENTRY ~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#4(~b.base, ~b.offset, 4); 5400#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 5376#func_to_recursive_line_23_to_24_0FINAL assume true; 5379#func_to_recursive_line_23_to_24_0EXIT >#51#return; 5389#func_to_recursive_line_23_to_24_0FINAL assume true; 5419#func_to_recursive_line_23_to_24_0EXIT >#51#return; 5417#func_to_recursive_line_23_to_24_0FINAL assume true; 5416#func_to_recursive_line_23_to_24_0EXIT >#57#return; 5398#L87 call #t~mem14 := read~int#1(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 5386#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);< 5388#func_to_recursive_line_22_to_23_0ENTRY [2024-11-10 23:19:05,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:19:05,650 INFO L85 PathProgramCache]: Analyzing trace with hash 73468, now seen corresponding path program 9 times [2024-11-10 23:19:05,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:19:05,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488339859] [2024-11-10 23:19:05,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:19:05,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:19:05,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:19:05,656 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:19:05,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:19:05,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:19:05,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:19:05,660 INFO L85 PathProgramCache]: Analyzing trace with hash 465538389, now seen corresponding path program 6 times [2024-11-10 23:19:05,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:19:05,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625642529] [2024-11-10 23:19:05,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:19:05,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:19:05,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:06,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:07,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:07,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:07,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:07,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:07,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:07,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:07,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:07,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:07,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:07,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:07,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:07,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:07,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:07,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:07,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:08,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:08,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:08,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:08,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:08,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:08,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:08,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:08,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:08,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:08,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-10 23:19:08,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:08,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:08,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:08,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:08,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:08,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:08,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:08,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:08,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:08,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:08,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:08,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:08,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:08,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:08,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:08,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:08,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:08,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:08,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:08,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:08,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:08,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:08,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-10 23:19:08,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,467 INFO L134 CoverageAnalysis]: Checked inductivity of 4246 backedges. 4 proven. 93 refuted. 0 times theorem prover too weak. 4149 trivial. 0 not checked. [2024-11-10 23:19:08,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:19:08,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625642529] [2024-11-10 23:19:08,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625642529] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 23:19:08,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065905182] [2024-11-10 23:19:08,468 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-10 23:19:08,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 23:19:08,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:19:08,469 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 23:19:08,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 23:19:08,666 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-11-10 23:19:08,667 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 23:19:08,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-10 23:19:08,674 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:19:08,678 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-10 23:19:08,845 INFO L134 CoverageAnalysis]: Checked inductivity of 4246 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4238 trivial. 0 not checked. [2024-11-10 23:19:08,846 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 23:19:09,759 INFO L134 CoverageAnalysis]: Checked inductivity of 4246 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 4231 trivial. 0 not checked. [2024-11-10 23:19:09,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065905182] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 23:19:09,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 23:19:09,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 14] total 34 [2024-11-10 23:19:09,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104828897] [2024-11-10 23:19:09,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 23:19:09,760 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:19:09,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:19:09,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-10 23:19:09,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=974, Unknown=0, NotChecked=0, Total=1122 [2024-11-10 23:19:09,761 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. cyclomatic complexity: 10 Second operand has 34 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 27 states have internal predecessors, (52), 13 states have call successors, (22), 9 states have call predecessors, (22), 12 states have return successors, (21), 13 states have call predecessors, (21), 13 states have call successors, (21) [2024-11-10 23:19:10,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:19:10,144 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2024-11-10 23:19:10,144 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 59 transitions. [2024-11-10 23:19:10,144 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-10 23:19:10,145 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 59 transitions. [2024-11-10 23:19:10,145 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2024-11-10 23:19:10,145 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2024-11-10 23:19:10,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 59 transitions. [2024-11-10 23:19:10,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:19:10,146 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 59 transitions. [2024-11-10 23:19:10,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 59 transitions. [2024-11-10 23:19:10,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-10 23:19:10,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 29 states have (on average 1.103448275862069) internal successors, (32), 32 states have internal predecessors, (32), 8 states have call successors, (8), 4 states have call predecessors, (8), 16 states have return successors, (19), 16 states have call predecessors, (19), 6 states have call successors, (19) [2024-11-10 23:19:10,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2024-11-10 23:19:10,150 INFO L240 hiAutomatonCegarLoop]: Abstraction has 53 states and 59 transitions. [2024-11-10 23:19:10,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 23:19:10,151 INFO L425 stractBuchiCegarLoop]: Abstraction has 53 states and 59 transitions. [2024-11-10 23:19:10,151 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-10 23:19:10,151 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 59 transitions. [2024-11-10 23:19:10,151 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-10 23:19:10,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:19:10,151 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:19:10,154 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-10 23:19:10,154 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [84, 84, 72, 72, 72, 15, 15, 12, 12, 12, 12, 12, 12, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:19:10,154 INFO L745 eck$LassoCheckResult]: Stem: 8956#ULTIMATE.startENTRY 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); 8957#ULTIMATE.init_returnLabel#1 assume true;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#1(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#4(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#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 8942#L107-1 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);< 8943#func_to_recursive_line_22_to_23_0ENTRY [2024-11-10 23:19:10,154 INFO L747 eck$LassoCheckResult]: Loop: 8943#func_to_recursive_line_22_to_23_0ENTRY ~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#1(~a.base, ~a.offset, 4); 8945#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~b.base, ~b.offset, 4); 8933#L87-1 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 8935#func_to_recursive_line_23_to_24_0ENTRY ~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#4(~b.base, ~b.offset, 4); 8955#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 8937#L67-1 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 8951#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 8936#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 8939#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8948#func_to_recursive_line_25_to_25_0FINAL assume true; 8950#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8958#func_to_recursive_line_25_to_25_0FINAL assume true; 8975#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8973#func_to_recursive_line_25_to_25_0FINAL assume true; 8970#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8969#func_to_recursive_line_25_to_25_0FINAL assume true; 8968#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8967#func_to_recursive_line_25_to_25_0FINAL assume true; 8966#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8965#func_to_recursive_line_25_to_25_0FINAL assume true; 8964#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8963#func_to_recursive_line_25_to_25_0FINAL assume true; 8962#func_to_recursive_line_25_to_25_0EXIT >#49#return; 8961#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 8938#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 8951#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 8936#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 8939#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8948#func_to_recursive_line_25_to_25_0FINAL assume true; 8950#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8958#func_to_recursive_line_25_to_25_0FINAL assume true; 8975#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8973#func_to_recursive_line_25_to_25_0FINAL assume true; 8970#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8969#func_to_recursive_line_25_to_25_0FINAL assume true; 8968#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8967#func_to_recursive_line_25_to_25_0FINAL assume true; 8966#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8965#func_to_recursive_line_25_to_25_0FINAL assume true; 8964#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8963#func_to_recursive_line_25_to_25_0FINAL assume true; 8962#func_to_recursive_line_25_to_25_0EXIT >#49#return; 8961#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 8938#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 8951#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 8936#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 8939#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8948#func_to_recursive_line_25_to_25_0FINAL assume true; 8950#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8958#func_to_recursive_line_25_to_25_0FINAL assume true; 8975#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8973#func_to_recursive_line_25_to_25_0FINAL assume true; 8970#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8969#func_to_recursive_line_25_to_25_0FINAL assume true; 8968#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8967#func_to_recursive_line_25_to_25_0FINAL assume true; 8966#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8965#func_to_recursive_line_25_to_25_0FINAL assume true; 8964#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8963#func_to_recursive_line_25_to_25_0FINAL assume true; 8962#func_to_recursive_line_25_to_25_0EXIT >#49#return; 8961#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 8938#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 8951#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 8936#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 8939#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8948#func_to_recursive_line_25_to_25_0FINAL assume true; 8950#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8958#func_to_recursive_line_25_to_25_0FINAL assume true; 8975#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8973#func_to_recursive_line_25_to_25_0FINAL assume true; 8970#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8969#func_to_recursive_line_25_to_25_0FINAL assume true; 8968#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8967#func_to_recursive_line_25_to_25_0FINAL assume true; 8966#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8965#func_to_recursive_line_25_to_25_0FINAL assume true; 8964#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8963#func_to_recursive_line_25_to_25_0FINAL assume true; 8962#func_to_recursive_line_25_to_25_0EXIT >#49#return; 8961#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 8938#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 8951#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 8936#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8940#func_to_recursive_line_24_to_25_0FINAL assume true; 8960#func_to_recursive_line_24_to_25_0EXIT >#47#return; 8946#func_to_recursive_line_24_to_25_0FINAL assume true; 8947#func_to_recursive_line_24_to_25_0EXIT >#47#return; 8983#func_to_recursive_line_24_to_25_0FINAL assume true; 8982#func_to_recursive_line_24_to_25_0EXIT >#47#return; 8981#func_to_recursive_line_24_to_25_0FINAL assume true; 8980#func_to_recursive_line_24_to_25_0EXIT >#47#return; 8979#func_to_recursive_line_24_to_25_0FINAL assume true; 8978#func_to_recursive_line_24_to_25_0EXIT >#53#return; 8954#L67 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 8932#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 8935#func_to_recursive_line_23_to_24_0ENTRY ~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#4(~b.base, ~b.offset, 4); 8955#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 8937#L67-1 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 8951#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 8936#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 8939#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8948#func_to_recursive_line_25_to_25_0FINAL assume true; 8950#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8958#func_to_recursive_line_25_to_25_0FINAL assume true; 8975#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8973#func_to_recursive_line_25_to_25_0FINAL assume true; 8970#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8969#func_to_recursive_line_25_to_25_0FINAL assume true; 8968#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8967#func_to_recursive_line_25_to_25_0FINAL assume true; 8966#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8965#func_to_recursive_line_25_to_25_0FINAL assume true; 8964#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8963#func_to_recursive_line_25_to_25_0FINAL assume true; 8962#func_to_recursive_line_25_to_25_0EXIT >#49#return; 8961#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 8938#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 8951#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 8936#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 8939#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8948#func_to_recursive_line_25_to_25_0FINAL assume true; 8950#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8958#func_to_recursive_line_25_to_25_0FINAL assume true; 8975#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8973#func_to_recursive_line_25_to_25_0FINAL assume true; 8970#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8969#func_to_recursive_line_25_to_25_0FINAL assume true; 8968#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8967#func_to_recursive_line_25_to_25_0FINAL assume true; 8966#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8965#func_to_recursive_line_25_to_25_0FINAL assume true; 8964#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8963#func_to_recursive_line_25_to_25_0FINAL assume true; 8962#func_to_recursive_line_25_to_25_0EXIT >#49#return; 8961#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 8938#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 8951#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 8936#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 8939#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8948#func_to_recursive_line_25_to_25_0FINAL assume true; 8950#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8958#func_to_recursive_line_25_to_25_0FINAL assume true; 8975#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8973#func_to_recursive_line_25_to_25_0FINAL assume true; 8970#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8969#func_to_recursive_line_25_to_25_0FINAL assume true; 8968#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8967#func_to_recursive_line_25_to_25_0FINAL assume true; 8966#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8965#func_to_recursive_line_25_to_25_0FINAL assume true; 8964#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8963#func_to_recursive_line_25_to_25_0FINAL assume true; 8962#func_to_recursive_line_25_to_25_0EXIT >#49#return; 8961#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 8938#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 8951#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 8936#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 8939#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8948#func_to_recursive_line_25_to_25_0FINAL assume true; 8950#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8958#func_to_recursive_line_25_to_25_0FINAL assume true; 8975#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8973#func_to_recursive_line_25_to_25_0FINAL assume true; 8970#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8969#func_to_recursive_line_25_to_25_0FINAL assume true; 8968#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8967#func_to_recursive_line_25_to_25_0FINAL assume true; 8966#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8965#func_to_recursive_line_25_to_25_0FINAL assume true; 8964#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8963#func_to_recursive_line_25_to_25_0FINAL assume true; 8962#func_to_recursive_line_25_to_25_0EXIT >#49#return; 8961#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 8938#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 8951#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 8936#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8940#func_to_recursive_line_24_to_25_0FINAL assume true; 8960#func_to_recursive_line_24_to_25_0EXIT >#47#return; 8946#func_to_recursive_line_24_to_25_0FINAL assume true; 8947#func_to_recursive_line_24_to_25_0EXIT >#47#return; 8983#func_to_recursive_line_24_to_25_0FINAL assume true; 8982#func_to_recursive_line_24_to_25_0EXIT >#47#return; 8981#func_to_recursive_line_24_to_25_0FINAL assume true; 8980#func_to_recursive_line_24_to_25_0EXIT >#47#return; 8979#func_to_recursive_line_24_to_25_0FINAL assume true; 8978#func_to_recursive_line_24_to_25_0EXIT >#53#return; 8954#L67 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 8932#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 8935#func_to_recursive_line_23_to_24_0ENTRY ~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#4(~b.base, ~b.offset, 4); 8955#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 8937#L67-1 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 8951#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 8936#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 8939#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8948#func_to_recursive_line_25_to_25_0FINAL assume true; 8950#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8958#func_to_recursive_line_25_to_25_0FINAL assume true; 8975#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8973#func_to_recursive_line_25_to_25_0FINAL assume true; 8970#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8969#func_to_recursive_line_25_to_25_0FINAL assume true; 8968#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8967#func_to_recursive_line_25_to_25_0FINAL assume true; 8966#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8965#func_to_recursive_line_25_to_25_0FINAL assume true; 8964#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8963#func_to_recursive_line_25_to_25_0FINAL assume true; 8962#func_to_recursive_line_25_to_25_0EXIT >#49#return; 8961#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 8938#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 8951#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 8936#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 8939#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8948#func_to_recursive_line_25_to_25_0FINAL assume true; 8950#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8958#func_to_recursive_line_25_to_25_0FINAL assume true; 8975#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8973#func_to_recursive_line_25_to_25_0FINAL assume true; 8970#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8969#func_to_recursive_line_25_to_25_0FINAL assume true; 8968#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8967#func_to_recursive_line_25_to_25_0FINAL assume true; 8966#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8965#func_to_recursive_line_25_to_25_0FINAL assume true; 8964#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8963#func_to_recursive_line_25_to_25_0FINAL assume true; 8962#func_to_recursive_line_25_to_25_0EXIT >#49#return; 8961#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 8938#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 8951#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 8936#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 8939#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8948#func_to_recursive_line_25_to_25_0FINAL assume true; 8950#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8958#func_to_recursive_line_25_to_25_0FINAL assume true; 8975#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8973#func_to_recursive_line_25_to_25_0FINAL assume true; 8970#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8969#func_to_recursive_line_25_to_25_0FINAL assume true; 8968#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8967#func_to_recursive_line_25_to_25_0FINAL assume true; 8966#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8965#func_to_recursive_line_25_to_25_0FINAL assume true; 8964#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8963#func_to_recursive_line_25_to_25_0FINAL assume true; 8962#func_to_recursive_line_25_to_25_0EXIT >#49#return; 8961#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 8938#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 8951#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 8936#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 8939#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8949#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8952#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 8959#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8948#func_to_recursive_line_25_to_25_0FINAL assume true; 8950#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8958#func_to_recursive_line_25_to_25_0FINAL assume true; 8975#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8973#func_to_recursive_line_25_to_25_0FINAL assume true; 8970#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8969#func_to_recursive_line_25_to_25_0FINAL assume true; 8968#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8967#func_to_recursive_line_25_to_25_0FINAL assume true; 8966#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8965#func_to_recursive_line_25_to_25_0FINAL assume true; 8964#func_to_recursive_line_25_to_25_0EXIT >#59#return; 8963#func_to_recursive_line_25_to_25_0FINAL assume true; 8962#func_to_recursive_line_25_to_25_0EXIT >#49#return; 8961#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 8938#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 8951#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 8936#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8940#func_to_recursive_line_24_to_25_0FINAL assume true; 8960#func_to_recursive_line_24_to_25_0EXIT >#47#return; 8946#func_to_recursive_line_24_to_25_0FINAL assume true; 8947#func_to_recursive_line_24_to_25_0EXIT >#47#return; 8983#func_to_recursive_line_24_to_25_0FINAL assume true; 8982#func_to_recursive_line_24_to_25_0EXIT >#47#return; 8981#func_to_recursive_line_24_to_25_0FINAL assume true; 8980#func_to_recursive_line_24_to_25_0EXIT >#47#return; 8979#func_to_recursive_line_24_to_25_0FINAL assume true; 8978#func_to_recursive_line_24_to_25_0EXIT >#53#return; 8954#L67 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 8932#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 8935#func_to_recursive_line_23_to_24_0ENTRY ~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#4(~b.base, ~b.offset, 4); 8955#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 8931#func_to_recursive_line_23_to_24_0FINAL assume true; 8934#func_to_recursive_line_23_to_24_0EXIT >#51#return; 8944#func_to_recursive_line_23_to_24_0FINAL assume true; 8977#func_to_recursive_line_23_to_24_0EXIT >#51#return; 8976#func_to_recursive_line_23_to_24_0FINAL assume true; 8974#func_to_recursive_line_23_to_24_0EXIT >#51#return; 8972#func_to_recursive_line_23_to_24_0FINAL assume true; 8971#func_to_recursive_line_23_to_24_0EXIT >#57#return; 8953#L87 call #t~mem14 := read~int#1(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 8941#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);< 8943#func_to_recursive_line_22_to_23_0ENTRY [2024-11-10 23:19:10,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:19:10,157 INFO L85 PathProgramCache]: Analyzing trace with hash 73468, now seen corresponding path program 10 times [2024-11-10 23:19:10,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:19:10,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524304256] [2024-11-10 23:19:10,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:19:10,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:19:10,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:19:10,168 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:19:10,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:19:10,176 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:19:10,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:19:10,176 INFO L85 PathProgramCache]: Analyzing trace with hash -130987107, now seen corresponding path program 7 times [2024-11-10 23:19:10,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:19:10,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744731025] [2024-11-10 23:19:10,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:19:10,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:19:10,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:12,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:14,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:14,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:14,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:14,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:14,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:14,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:14,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:14,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:14,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:14,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:14,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:14,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:14,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:15,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:15,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 23:19:15,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:15,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:15,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:15,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:15,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 23:19:15,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:15,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:15,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:16,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:16,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:16,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:16,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:16,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:16,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:16,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:16,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:16,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:16,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:16,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:16,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:16,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:16,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:16,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:16,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:16,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:16,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:16,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:16,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:16,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:16,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:16,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 23:19:16,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:16,052 INFO L134 CoverageAnalysis]: Checked inductivity of 17151 backedges. 6 proven. 276 refuted. 0 times theorem prover too weak. 16869 trivial. 0 not checked. [2024-11-10 23:19:16,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:19:16,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744731025] [2024-11-10 23:19:16,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744731025] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 23:19:16,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995512881] [2024-11-10 23:19:16,053 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-10 23:19:16,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 23:19:16,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:19:16,055 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 23:19:16,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-10 23:19:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:16,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 3068 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-11-10 23:19:16,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:19:16,563 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-10 23:19:16,847 INFO L134 CoverageAnalysis]: Checked inductivity of 17151 backedges. 7728 proven. 24 refuted. 0 times theorem prover too weak. 9399 trivial. 0 not checked. [2024-11-10 23:19:16,847 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 23:19:19,216 INFO L134 CoverageAnalysis]: Checked inductivity of 17151 backedges. 6 proven. 360 refuted. 0 times theorem prover too weak. 16785 trivial. 0 not checked. [2024-11-10 23:19:19,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995512881] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 23:19:19,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 23:19:19,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 22] total 40 [2024-11-10 23:19:19,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683431460] [2024-11-10 23:19:19,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 23:19:19,218 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:19:19,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:19:19,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-10 23:19:19,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=1275, Unknown=0, NotChecked=0, Total=1560 [2024-11-10 23:19:19,219 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. cyclomatic complexity: 10 Second operand has 40 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 31 states have internal predecessors, (72), 16 states have call successors, (35), 11 states have call predecessors, (35), 12 states have return successors, (32), 15 states have call predecessors, (32), 16 states have call successors, (32) [2024-11-10 23:19:19,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:19:19,501 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2024-11-10 23:19:19,501 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 61 transitions. [2024-11-10 23:19:19,502 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-10 23:19:19,503 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 55 states and 61 transitions. [2024-11-10 23:19:19,503 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2024-11-10 23:19:19,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2024-11-10 23:19:19,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 61 transitions. [2024-11-10 23:19:19,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:19:19,504 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 61 transitions. [2024-11-10 23:19:19,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 61 transitions. [2024-11-10 23:19:19,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-10 23:19:19,509 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-10 23:19:19,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2024-11-10 23:19:19,512 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 61 transitions. [2024-11-10 23:19:19,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 23:19:19,513 INFO L425 stractBuchiCegarLoop]: Abstraction has 55 states and 61 transitions. [2024-11-10 23:19:19,513 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-10 23:19:19,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 61 transitions. [2024-11-10 23:19:19,514 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-10 23:19:19,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:19:19,514 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:19:19,516 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-10 23:19:19,516 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [105, 105, 90, 90, 90, 18, 18, 15, 15, 15, 15, 15, 15, 15, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:19:19,516 INFO L745 eck$LassoCheckResult]: Stem: 16267#ULTIMATE.startENTRY 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); 16268#ULTIMATE.init_returnLabel#1 assume true;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#1(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#4(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#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 16253#L107-1 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);< 16254#func_to_recursive_line_22_to_23_0ENTRY [2024-11-10 23:19:19,517 INFO L747 eck$LassoCheckResult]: Loop: 16254#func_to_recursive_line_22_to_23_0ENTRY ~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#1(~a.base, ~a.offset, 4); 16256#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~b.base, ~b.offset, 4); 16244#L87-1 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 16246#func_to_recursive_line_23_to_24_0ENTRY ~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#4(~b.base, ~b.offset, 4); 16266#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 16248#L67-1 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 16262#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 16247#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 16250#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16259#func_to_recursive_line_25_to_25_0FINAL assume true; 16261#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16269#func_to_recursive_line_25_to_25_0FINAL assume true; 16286#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16284#func_to_recursive_line_25_to_25_0FINAL assume true; 16281#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16280#func_to_recursive_line_25_to_25_0FINAL assume true; 16279#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16278#func_to_recursive_line_25_to_25_0FINAL assume true; 16277#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16276#func_to_recursive_line_25_to_25_0FINAL assume true; 16275#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16274#func_to_recursive_line_25_to_25_0FINAL assume true; 16273#func_to_recursive_line_25_to_25_0EXIT >#49#return; 16272#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 16249#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 16262#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 16247#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 16250#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16259#func_to_recursive_line_25_to_25_0FINAL assume true; 16261#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16269#func_to_recursive_line_25_to_25_0FINAL assume true; 16286#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16284#func_to_recursive_line_25_to_25_0FINAL assume true; 16281#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16280#func_to_recursive_line_25_to_25_0FINAL assume true; 16279#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16278#func_to_recursive_line_25_to_25_0FINAL assume true; 16277#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16276#func_to_recursive_line_25_to_25_0FINAL assume true; 16275#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16274#func_to_recursive_line_25_to_25_0FINAL assume true; 16273#func_to_recursive_line_25_to_25_0EXIT >#49#return; 16272#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 16249#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 16262#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 16247#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 16250#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16259#func_to_recursive_line_25_to_25_0FINAL assume true; 16261#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16269#func_to_recursive_line_25_to_25_0FINAL assume true; 16286#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16284#func_to_recursive_line_25_to_25_0FINAL assume true; 16281#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16280#func_to_recursive_line_25_to_25_0FINAL assume true; 16279#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16278#func_to_recursive_line_25_to_25_0FINAL assume true; 16277#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16276#func_to_recursive_line_25_to_25_0FINAL assume true; 16275#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16274#func_to_recursive_line_25_to_25_0FINAL assume true; 16273#func_to_recursive_line_25_to_25_0EXIT >#49#return; 16272#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 16249#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 16262#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 16247#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 16250#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16259#func_to_recursive_line_25_to_25_0FINAL assume true; 16261#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16269#func_to_recursive_line_25_to_25_0FINAL assume true; 16286#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16284#func_to_recursive_line_25_to_25_0FINAL assume true; 16281#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16280#func_to_recursive_line_25_to_25_0FINAL assume true; 16279#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16278#func_to_recursive_line_25_to_25_0FINAL assume true; 16277#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16276#func_to_recursive_line_25_to_25_0FINAL assume true; 16275#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16274#func_to_recursive_line_25_to_25_0FINAL assume true; 16273#func_to_recursive_line_25_to_25_0EXIT >#49#return; 16272#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 16249#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 16262#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 16247#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 16250#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16259#func_to_recursive_line_25_to_25_0FINAL assume true; 16261#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16269#func_to_recursive_line_25_to_25_0FINAL assume true; 16286#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16284#func_to_recursive_line_25_to_25_0FINAL assume true; 16281#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16280#func_to_recursive_line_25_to_25_0FINAL assume true; 16279#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16278#func_to_recursive_line_25_to_25_0FINAL assume true; 16277#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16276#func_to_recursive_line_25_to_25_0FINAL assume true; 16275#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16274#func_to_recursive_line_25_to_25_0FINAL assume true; 16273#func_to_recursive_line_25_to_25_0EXIT >#49#return; 16272#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 16249#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 16262#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 16247#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 16251#func_to_recursive_line_24_to_25_0FINAL assume true; 16271#func_to_recursive_line_24_to_25_0EXIT >#47#return; 16257#func_to_recursive_line_24_to_25_0FINAL assume true; 16258#func_to_recursive_line_24_to_25_0EXIT >#47#return; 16296#func_to_recursive_line_24_to_25_0FINAL assume true; 16295#func_to_recursive_line_24_to_25_0EXIT >#47#return; 16294#func_to_recursive_line_24_to_25_0FINAL assume true; 16293#func_to_recursive_line_24_to_25_0EXIT >#47#return; 16292#func_to_recursive_line_24_to_25_0FINAL assume true; 16291#func_to_recursive_line_24_to_25_0EXIT >#47#return; 16290#func_to_recursive_line_24_to_25_0FINAL assume true; 16289#func_to_recursive_line_24_to_25_0EXIT >#53#return; 16265#L67 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 16243#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 16246#func_to_recursive_line_23_to_24_0ENTRY ~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#4(~b.base, ~b.offset, 4); 16266#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 16248#L67-1 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 16262#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 16247#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 16250#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16259#func_to_recursive_line_25_to_25_0FINAL assume true; 16261#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16269#func_to_recursive_line_25_to_25_0FINAL assume true; 16286#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16284#func_to_recursive_line_25_to_25_0FINAL assume true; 16281#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16280#func_to_recursive_line_25_to_25_0FINAL assume true; 16279#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16278#func_to_recursive_line_25_to_25_0FINAL assume true; 16277#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16276#func_to_recursive_line_25_to_25_0FINAL assume true; 16275#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16274#func_to_recursive_line_25_to_25_0FINAL assume true; 16273#func_to_recursive_line_25_to_25_0EXIT >#49#return; 16272#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 16249#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 16262#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 16247#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 16250#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16259#func_to_recursive_line_25_to_25_0FINAL assume true; 16261#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16269#func_to_recursive_line_25_to_25_0FINAL assume true; 16286#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16284#func_to_recursive_line_25_to_25_0FINAL assume true; 16281#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16280#func_to_recursive_line_25_to_25_0FINAL assume true; 16279#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16278#func_to_recursive_line_25_to_25_0FINAL assume true; 16277#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16276#func_to_recursive_line_25_to_25_0FINAL assume true; 16275#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16274#func_to_recursive_line_25_to_25_0FINAL assume true; 16273#func_to_recursive_line_25_to_25_0EXIT >#49#return; 16272#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 16249#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 16262#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 16247#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 16250#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16259#func_to_recursive_line_25_to_25_0FINAL assume true; 16261#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16269#func_to_recursive_line_25_to_25_0FINAL assume true; 16286#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16284#func_to_recursive_line_25_to_25_0FINAL assume true; 16281#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16280#func_to_recursive_line_25_to_25_0FINAL assume true; 16279#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16278#func_to_recursive_line_25_to_25_0FINAL assume true; 16277#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16276#func_to_recursive_line_25_to_25_0FINAL assume true; 16275#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16274#func_to_recursive_line_25_to_25_0FINAL assume true; 16273#func_to_recursive_line_25_to_25_0EXIT >#49#return; 16272#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 16249#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 16262#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 16247#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 16250#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16259#func_to_recursive_line_25_to_25_0FINAL assume true; 16261#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16269#func_to_recursive_line_25_to_25_0FINAL assume true; 16286#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16284#func_to_recursive_line_25_to_25_0FINAL assume true; 16281#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16280#func_to_recursive_line_25_to_25_0FINAL assume true; 16279#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16278#func_to_recursive_line_25_to_25_0FINAL assume true; 16277#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16276#func_to_recursive_line_25_to_25_0FINAL assume true; 16275#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16274#func_to_recursive_line_25_to_25_0FINAL assume true; 16273#func_to_recursive_line_25_to_25_0EXIT >#49#return; 16272#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 16249#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 16262#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 16247#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 16250#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16259#func_to_recursive_line_25_to_25_0FINAL assume true; 16261#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16269#func_to_recursive_line_25_to_25_0FINAL assume true; 16286#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16284#func_to_recursive_line_25_to_25_0FINAL assume true; 16281#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16280#func_to_recursive_line_25_to_25_0FINAL assume true; 16279#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16278#func_to_recursive_line_25_to_25_0FINAL assume true; 16277#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16276#func_to_recursive_line_25_to_25_0FINAL assume true; 16275#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16274#func_to_recursive_line_25_to_25_0FINAL assume true; 16273#func_to_recursive_line_25_to_25_0EXIT >#49#return; 16272#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 16249#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 16262#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 16247#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 16251#func_to_recursive_line_24_to_25_0FINAL assume true; 16271#func_to_recursive_line_24_to_25_0EXIT >#47#return; 16257#func_to_recursive_line_24_to_25_0FINAL assume true; 16258#func_to_recursive_line_24_to_25_0EXIT >#47#return; 16296#func_to_recursive_line_24_to_25_0FINAL assume true; 16295#func_to_recursive_line_24_to_25_0EXIT >#47#return; 16294#func_to_recursive_line_24_to_25_0FINAL assume true; 16293#func_to_recursive_line_24_to_25_0EXIT >#47#return; 16292#func_to_recursive_line_24_to_25_0FINAL assume true; 16291#func_to_recursive_line_24_to_25_0EXIT >#47#return; 16290#func_to_recursive_line_24_to_25_0FINAL assume true; 16289#func_to_recursive_line_24_to_25_0EXIT >#53#return; 16265#L67 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 16243#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 16246#func_to_recursive_line_23_to_24_0ENTRY ~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#4(~b.base, ~b.offset, 4); 16266#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 16248#L67-1 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 16262#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 16247#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 16250#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16259#func_to_recursive_line_25_to_25_0FINAL assume true; 16261#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16269#func_to_recursive_line_25_to_25_0FINAL assume true; 16286#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16284#func_to_recursive_line_25_to_25_0FINAL assume true; 16281#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16280#func_to_recursive_line_25_to_25_0FINAL assume true; 16279#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16278#func_to_recursive_line_25_to_25_0FINAL assume true; 16277#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16276#func_to_recursive_line_25_to_25_0FINAL assume true; 16275#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16274#func_to_recursive_line_25_to_25_0FINAL assume true; 16273#func_to_recursive_line_25_to_25_0EXIT >#49#return; 16272#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 16249#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 16262#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 16247#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 16250#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16259#func_to_recursive_line_25_to_25_0FINAL assume true; 16261#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16269#func_to_recursive_line_25_to_25_0FINAL assume true; 16286#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16284#func_to_recursive_line_25_to_25_0FINAL assume true; 16281#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16280#func_to_recursive_line_25_to_25_0FINAL assume true; 16279#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16278#func_to_recursive_line_25_to_25_0FINAL assume true; 16277#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16276#func_to_recursive_line_25_to_25_0FINAL assume true; 16275#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16274#func_to_recursive_line_25_to_25_0FINAL assume true; 16273#func_to_recursive_line_25_to_25_0EXIT >#49#return; 16272#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 16249#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 16262#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 16247#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 16250#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16259#func_to_recursive_line_25_to_25_0FINAL assume true; 16261#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16269#func_to_recursive_line_25_to_25_0FINAL assume true; 16286#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16284#func_to_recursive_line_25_to_25_0FINAL assume true; 16281#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16280#func_to_recursive_line_25_to_25_0FINAL assume true; 16279#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16278#func_to_recursive_line_25_to_25_0FINAL assume true; 16277#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16276#func_to_recursive_line_25_to_25_0FINAL assume true; 16275#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16274#func_to_recursive_line_25_to_25_0FINAL assume true; 16273#func_to_recursive_line_25_to_25_0EXIT >#49#return; 16272#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 16249#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 16262#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 16247#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 16250#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16259#func_to_recursive_line_25_to_25_0FINAL assume true; 16261#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16269#func_to_recursive_line_25_to_25_0FINAL assume true; 16286#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16284#func_to_recursive_line_25_to_25_0FINAL assume true; 16281#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16280#func_to_recursive_line_25_to_25_0FINAL assume true; 16279#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16278#func_to_recursive_line_25_to_25_0FINAL assume true; 16277#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16276#func_to_recursive_line_25_to_25_0FINAL assume true; 16275#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16274#func_to_recursive_line_25_to_25_0FINAL assume true; 16273#func_to_recursive_line_25_to_25_0EXIT >#49#return; 16272#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 16249#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 16262#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 16247#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 16250#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16260#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16263#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 16270#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16259#func_to_recursive_line_25_to_25_0FINAL assume true; 16261#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16269#func_to_recursive_line_25_to_25_0FINAL assume true; 16286#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16284#func_to_recursive_line_25_to_25_0FINAL assume true; 16281#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16280#func_to_recursive_line_25_to_25_0FINAL assume true; 16279#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16278#func_to_recursive_line_25_to_25_0FINAL assume true; 16277#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16276#func_to_recursive_line_25_to_25_0FINAL assume true; 16275#func_to_recursive_line_25_to_25_0EXIT >#59#return; 16274#func_to_recursive_line_25_to_25_0FINAL assume true; 16273#func_to_recursive_line_25_to_25_0EXIT >#49#return; 16272#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 16249#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 16262#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 16247#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 16251#func_to_recursive_line_24_to_25_0FINAL assume true; 16271#func_to_recursive_line_24_to_25_0EXIT >#47#return; 16257#func_to_recursive_line_24_to_25_0FINAL assume true; 16258#func_to_recursive_line_24_to_25_0EXIT >#47#return; 16296#func_to_recursive_line_24_to_25_0FINAL assume true; 16295#func_to_recursive_line_24_to_25_0EXIT >#47#return; 16294#func_to_recursive_line_24_to_25_0FINAL assume true; 16293#func_to_recursive_line_24_to_25_0EXIT >#47#return; 16292#func_to_recursive_line_24_to_25_0FINAL assume true; 16291#func_to_recursive_line_24_to_25_0EXIT >#47#return; 16290#func_to_recursive_line_24_to_25_0FINAL assume true; 16289#func_to_recursive_line_24_to_25_0EXIT >#53#return; 16265#L67 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 16243#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 16246#func_to_recursive_line_23_to_24_0ENTRY ~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#4(~b.base, ~b.offset, 4); 16266#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 16242#func_to_recursive_line_23_to_24_0FINAL assume true; 16245#func_to_recursive_line_23_to_24_0EXIT >#51#return; 16255#func_to_recursive_line_23_to_24_0FINAL assume true; 16288#func_to_recursive_line_23_to_24_0EXIT >#51#return; 16287#func_to_recursive_line_23_to_24_0FINAL assume true; 16285#func_to_recursive_line_23_to_24_0EXIT >#51#return; 16283#func_to_recursive_line_23_to_24_0FINAL assume true; 16282#func_to_recursive_line_23_to_24_0EXIT >#57#return; 16264#L87 call #t~mem14 := read~int#1(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 16252#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);< 16254#func_to_recursive_line_22_to_23_0ENTRY [2024-11-10 23:19:19,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:19:19,518 INFO L85 PathProgramCache]: Analyzing trace with hash 73468, now seen corresponding path program 11 times [2024-11-10 23:19:19,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:19:19,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278553546] [2024-11-10 23:19:19,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:19:19,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:19:19,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:19:19,527 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:19:19,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:19:19,533 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:19:19,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:19:19,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1251961776, now seen corresponding path program 8 times [2024-11-10 23:19:19,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:19:19,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031178449] [2024-11-10 23:19:19,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:19:19,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:19:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:22,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:22,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:25,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:25,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:26,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:26,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:26,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:26,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:26,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:26,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:26,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:26,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:26,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:26,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:26,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:26,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:26,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:27,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:27,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:27,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:27,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:27,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:27,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:28,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:28,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:28,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:28,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:28,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:28,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:28,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:28,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:28,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:28,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:28,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:28,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:28,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:28,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:28,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:28,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:28,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:28,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:28,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:28,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:28,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:28,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:28,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:28,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:28,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:28,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:28,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:28,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:28,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:28,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:28,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:28,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:28,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:28,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:28,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:28,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:28,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:28,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:28,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:28,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:28,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-11-10 23:19:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:28,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:28,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:28,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:28,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:28,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:28,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:28,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:28,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:28,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:28,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:29,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:29,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:29,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-11-10 23:19:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:29,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:29,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:29,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:29,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:29,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:29,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-11-10 23:19:29,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:29,486 INFO L134 CoverageAnalysis]: Checked inductivity of 26805 backedges. 8 proven. 445 refuted. 0 times theorem prover too weak. 26352 trivial. 0 not checked. [2024-11-10 23:19:29,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:19:29,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031178449] [2024-11-10 23:19:29,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031178449] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 23:19:29,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793708400] [2024-11-10 23:19:29,486 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 23:19:29,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 23:19:29,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:19:29,488 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 23:19:29,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-10 23:19:30,171 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 23:19:30,171 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 23:19:30,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 3746 conjuncts, 92 conjuncts are in the unsatisfiable core [2024-11-10 23:19:30,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:19:30,224 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-10 23:19:30,735 INFO L134 CoverageAnalysis]: Checked inductivity of 26805 backedges. 12046 proven. 35 refuted. 0 times theorem prover too weak. 14724 trivial. 0 not checked. [2024-11-10 23:19:30,736 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 23:19:34,194 INFO L134 CoverageAnalysis]: Checked inductivity of 26805 backedges. 6 proven. 534 refuted. 0 times theorem prover too weak. 26265 trivial. 0 not checked. [2024-11-10 23:19:34,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793708400] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 23:19:34,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 23:19:34,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 14, 26] total 63 [2024-11-10 23:19:34,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797795791] [2024-11-10 23:19:34,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 23:19:34,197 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:19:34,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:19:34,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2024-11-10 23:19:34,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=527, Invalid=3379, Unknown=0, NotChecked=0, Total=3906 [2024-11-10 23:19:34,199 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. cyclomatic complexity: 10 Second operand has 63 states, 48 states have (on average 1.9375) internal successors, (93), 52 states have internal predecessors, (93), 27 states have call successors, (45), 12 states have call predecessors, (45), 18 states have return successors, (41), 27 states have call predecessors, (41), 27 states have call successors, (41) [2024-11-10 23:19:34,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:19:34,984 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2024-11-10 23:19:34,984 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 66 transitions. [2024-11-10 23:19:34,985 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-10 23:19:34,986 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 59 states and 66 transitions. [2024-11-10 23:19:34,986 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2024-11-10 23:19:34,986 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2024-11-10 23:19:34,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 66 transitions. [2024-11-10 23:19:34,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:19:34,986 INFO L218 hiAutomatonCegarLoop]: Abstraction has 59 states and 66 transitions. [2024-11-10 23:19:34,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 66 transitions. [2024-11-10 23:19:34,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2024-11-10 23:19:34,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 31 states have (on average 1.096774193548387) internal successors, (34), 34 states have internal predecessors, (34), 8 states have call successors, (8), 4 states have call predecessors, (8), 18 states have return successors, (21), 18 states have call predecessors, (21), 6 states have call successors, (21) [2024-11-10 23:19:34,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2024-11-10 23:19:34,991 INFO L240 hiAutomatonCegarLoop]: Abstraction has 57 states and 63 transitions. [2024-11-10 23:19:34,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 23:19:34,992 INFO L425 stractBuchiCegarLoop]: Abstraction has 57 states and 63 transitions. [2024-11-10 23:19:34,992 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-10 23:19:34,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 63 transitions. [2024-11-10 23:19:34,993 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-10 23:19:34,993 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:19:34,993 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:19:35,000 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-10 23:19:35,000 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [126, 126, 108, 108, 108, 21, 21, 18, 18, 18, 18, 18, 18, 18, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:19:35,000 INFO L745 eck$LassoCheckResult]: Stem: 25632#ULTIMATE.startENTRY 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); 25633#ULTIMATE.init_returnLabel#1 assume true;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#1(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#4(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#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 25619#L107-1 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);< 25620#func_to_recursive_line_22_to_23_0ENTRY [2024-11-10 23:19:35,001 INFO L747 eck$LassoCheckResult]: Loop: 25620#func_to_recursive_line_22_to_23_0ENTRY ~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#1(~a.base, ~a.offset, 4); 25622#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~b.base, ~b.offset, 4); 25609#L87-1 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 25612#func_to_recursive_line_23_to_24_0ENTRY ~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#4(~b.base, ~b.offset, 4); 25631#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 25614#L67-1 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 25627#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 25613#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 25616#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 25624#func_to_recursive_line_25_to_25_0FINAL assume true; 25626#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25634#func_to_recursive_line_25_to_25_0FINAL assume true; 25651#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25649#func_to_recursive_line_25_to_25_0FINAL assume true; 25646#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25645#func_to_recursive_line_25_to_25_0FINAL assume true; 25644#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25643#func_to_recursive_line_25_to_25_0FINAL assume true; 25642#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25641#func_to_recursive_line_25_to_25_0FINAL assume true; 25640#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25639#func_to_recursive_line_25_to_25_0FINAL assume true; 25638#func_to_recursive_line_25_to_25_0EXIT >#49#return; 25637#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 25615#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 25627#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 25613#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 25616#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 25624#func_to_recursive_line_25_to_25_0FINAL assume true; 25626#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25634#func_to_recursive_line_25_to_25_0FINAL assume true; 25651#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25649#func_to_recursive_line_25_to_25_0FINAL assume true; 25646#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25645#func_to_recursive_line_25_to_25_0FINAL assume true; 25644#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25643#func_to_recursive_line_25_to_25_0FINAL assume true; 25642#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25641#func_to_recursive_line_25_to_25_0FINAL assume true; 25640#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25639#func_to_recursive_line_25_to_25_0FINAL assume true; 25638#func_to_recursive_line_25_to_25_0EXIT >#49#return; 25637#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 25615#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 25627#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 25613#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 25616#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 25624#func_to_recursive_line_25_to_25_0FINAL assume true; 25626#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25634#func_to_recursive_line_25_to_25_0FINAL assume true; 25651#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25649#func_to_recursive_line_25_to_25_0FINAL assume true; 25646#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25645#func_to_recursive_line_25_to_25_0FINAL assume true; 25644#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25643#func_to_recursive_line_25_to_25_0FINAL assume true; 25642#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25641#func_to_recursive_line_25_to_25_0FINAL assume true; 25640#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25639#func_to_recursive_line_25_to_25_0FINAL assume true; 25638#func_to_recursive_line_25_to_25_0EXIT >#49#return; 25637#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 25615#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 25627#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 25613#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 25616#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 25624#func_to_recursive_line_25_to_25_0FINAL assume true; 25626#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25634#func_to_recursive_line_25_to_25_0FINAL assume true; 25651#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25649#func_to_recursive_line_25_to_25_0FINAL assume true; 25646#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25645#func_to_recursive_line_25_to_25_0FINAL assume true; 25644#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25643#func_to_recursive_line_25_to_25_0FINAL assume true; 25642#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25641#func_to_recursive_line_25_to_25_0FINAL assume true; 25640#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25639#func_to_recursive_line_25_to_25_0FINAL assume true; 25638#func_to_recursive_line_25_to_25_0EXIT >#49#return; 25637#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 25615#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 25627#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 25613#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 25616#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 25624#func_to_recursive_line_25_to_25_0FINAL assume true; 25626#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25634#func_to_recursive_line_25_to_25_0FINAL assume true; 25651#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25649#func_to_recursive_line_25_to_25_0FINAL assume true; 25646#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25645#func_to_recursive_line_25_to_25_0FINAL assume true; 25644#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25643#func_to_recursive_line_25_to_25_0FINAL assume true; 25642#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25641#func_to_recursive_line_25_to_25_0FINAL assume true; 25640#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25639#func_to_recursive_line_25_to_25_0FINAL assume true; 25638#func_to_recursive_line_25_to_25_0EXIT >#49#return; 25637#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 25615#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 25627#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 25613#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 25616#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 25624#func_to_recursive_line_25_to_25_0FINAL assume true; 25626#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25634#func_to_recursive_line_25_to_25_0FINAL assume true; 25651#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25649#func_to_recursive_line_25_to_25_0FINAL assume true; 25646#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25645#func_to_recursive_line_25_to_25_0FINAL assume true; 25644#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25643#func_to_recursive_line_25_to_25_0FINAL assume true; 25642#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25641#func_to_recursive_line_25_to_25_0FINAL assume true; 25640#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25639#func_to_recursive_line_25_to_25_0FINAL assume true; 25638#func_to_recursive_line_25_to_25_0EXIT >#49#return; 25637#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 25615#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 25627#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 25613#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 25617#func_to_recursive_line_24_to_25_0FINAL assume true; 25623#func_to_recursive_line_24_to_25_0EXIT >#47#return; 25636#func_to_recursive_line_24_to_25_0FINAL assume true; 25664#func_to_recursive_line_24_to_25_0EXIT >#47#return; 25663#func_to_recursive_line_24_to_25_0FINAL assume true; 25662#func_to_recursive_line_24_to_25_0EXIT >#47#return; 25661#func_to_recursive_line_24_to_25_0FINAL assume true; 25660#func_to_recursive_line_24_to_25_0EXIT >#47#return; 25659#func_to_recursive_line_24_to_25_0FINAL assume true; 25658#func_to_recursive_line_24_to_25_0EXIT >#47#return; 25657#func_to_recursive_line_24_to_25_0FINAL assume true; 25656#func_to_recursive_line_24_to_25_0EXIT >#47#return; 25655#func_to_recursive_line_24_to_25_0FINAL assume true; 25654#func_to_recursive_line_24_to_25_0EXIT >#53#return; 25630#L67 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 25610#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 25612#func_to_recursive_line_23_to_24_0ENTRY ~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#4(~b.base, ~b.offset, 4); 25631#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 25614#L67-1 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 25627#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 25613#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 25616#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 25624#func_to_recursive_line_25_to_25_0FINAL assume true; 25626#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25634#func_to_recursive_line_25_to_25_0FINAL assume true; 25651#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25649#func_to_recursive_line_25_to_25_0FINAL assume true; 25646#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25645#func_to_recursive_line_25_to_25_0FINAL assume true; 25644#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25643#func_to_recursive_line_25_to_25_0FINAL assume true; 25642#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25641#func_to_recursive_line_25_to_25_0FINAL assume true; 25640#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25639#func_to_recursive_line_25_to_25_0FINAL assume true; 25638#func_to_recursive_line_25_to_25_0EXIT >#49#return; 25637#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 25615#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 25627#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 25613#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 25616#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 25624#func_to_recursive_line_25_to_25_0FINAL assume true; 25626#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25634#func_to_recursive_line_25_to_25_0FINAL assume true; 25651#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25649#func_to_recursive_line_25_to_25_0FINAL assume true; 25646#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25645#func_to_recursive_line_25_to_25_0FINAL assume true; 25644#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25643#func_to_recursive_line_25_to_25_0FINAL assume true; 25642#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25641#func_to_recursive_line_25_to_25_0FINAL assume true; 25640#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25639#func_to_recursive_line_25_to_25_0FINAL assume true; 25638#func_to_recursive_line_25_to_25_0EXIT >#49#return; 25637#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 25615#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 25627#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 25613#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 25616#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 25624#func_to_recursive_line_25_to_25_0FINAL assume true; 25626#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25634#func_to_recursive_line_25_to_25_0FINAL assume true; 25651#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25649#func_to_recursive_line_25_to_25_0FINAL assume true; 25646#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25645#func_to_recursive_line_25_to_25_0FINAL assume true; 25644#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25643#func_to_recursive_line_25_to_25_0FINAL assume true; 25642#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25641#func_to_recursive_line_25_to_25_0FINAL assume true; 25640#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25639#func_to_recursive_line_25_to_25_0FINAL assume true; 25638#func_to_recursive_line_25_to_25_0EXIT >#49#return; 25637#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 25615#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 25627#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 25613#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 25616#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 25624#func_to_recursive_line_25_to_25_0FINAL assume true; 25626#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25634#func_to_recursive_line_25_to_25_0FINAL assume true; 25651#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25649#func_to_recursive_line_25_to_25_0FINAL assume true; 25646#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25645#func_to_recursive_line_25_to_25_0FINAL assume true; 25644#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25643#func_to_recursive_line_25_to_25_0FINAL assume true; 25642#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25641#func_to_recursive_line_25_to_25_0FINAL assume true; 25640#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25639#func_to_recursive_line_25_to_25_0FINAL assume true; 25638#func_to_recursive_line_25_to_25_0EXIT >#49#return; 25637#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 25615#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 25627#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 25613#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 25616#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 25624#func_to_recursive_line_25_to_25_0FINAL assume true; 25626#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25634#func_to_recursive_line_25_to_25_0FINAL assume true; 25651#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25649#func_to_recursive_line_25_to_25_0FINAL assume true; 25646#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25645#func_to_recursive_line_25_to_25_0FINAL assume true; 25644#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25643#func_to_recursive_line_25_to_25_0FINAL assume true; 25642#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25641#func_to_recursive_line_25_to_25_0FINAL assume true; 25640#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25639#func_to_recursive_line_25_to_25_0FINAL assume true; 25638#func_to_recursive_line_25_to_25_0EXIT >#49#return; 25637#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 25615#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 25627#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 25613#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 25616#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 25624#func_to_recursive_line_25_to_25_0FINAL assume true; 25626#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25634#func_to_recursive_line_25_to_25_0FINAL assume true; 25651#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25649#func_to_recursive_line_25_to_25_0FINAL assume true; 25646#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25645#func_to_recursive_line_25_to_25_0FINAL assume true; 25644#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25643#func_to_recursive_line_25_to_25_0FINAL assume true; 25642#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25641#func_to_recursive_line_25_to_25_0FINAL assume true; 25640#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25639#func_to_recursive_line_25_to_25_0FINAL assume true; 25638#func_to_recursive_line_25_to_25_0EXIT >#49#return; 25637#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 25615#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 25627#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 25613#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 25617#func_to_recursive_line_24_to_25_0FINAL assume true; 25623#func_to_recursive_line_24_to_25_0EXIT >#47#return; 25636#func_to_recursive_line_24_to_25_0FINAL assume true; 25664#func_to_recursive_line_24_to_25_0EXIT >#47#return; 25663#func_to_recursive_line_24_to_25_0FINAL assume true; 25662#func_to_recursive_line_24_to_25_0EXIT >#47#return; 25661#func_to_recursive_line_24_to_25_0FINAL assume true; 25660#func_to_recursive_line_24_to_25_0EXIT >#47#return; 25659#func_to_recursive_line_24_to_25_0FINAL assume true; 25658#func_to_recursive_line_24_to_25_0EXIT >#47#return; 25657#func_to_recursive_line_24_to_25_0FINAL assume true; 25656#func_to_recursive_line_24_to_25_0EXIT >#47#return; 25655#func_to_recursive_line_24_to_25_0FINAL assume true; 25654#func_to_recursive_line_24_to_25_0EXIT >#53#return; 25630#L67 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 25610#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 25612#func_to_recursive_line_23_to_24_0ENTRY ~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#4(~b.base, ~b.offset, 4); 25631#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 25614#L67-1 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 25627#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 25613#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 25616#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 25624#func_to_recursive_line_25_to_25_0FINAL assume true; 25626#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25634#func_to_recursive_line_25_to_25_0FINAL assume true; 25651#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25649#func_to_recursive_line_25_to_25_0FINAL assume true; 25646#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25645#func_to_recursive_line_25_to_25_0FINAL assume true; 25644#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25643#func_to_recursive_line_25_to_25_0FINAL assume true; 25642#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25641#func_to_recursive_line_25_to_25_0FINAL assume true; 25640#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25639#func_to_recursive_line_25_to_25_0FINAL assume true; 25638#func_to_recursive_line_25_to_25_0EXIT >#49#return; 25637#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 25615#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 25627#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 25613#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 25616#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 25624#func_to_recursive_line_25_to_25_0FINAL assume true; 25626#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25634#func_to_recursive_line_25_to_25_0FINAL assume true; 25651#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25649#func_to_recursive_line_25_to_25_0FINAL assume true; 25646#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25645#func_to_recursive_line_25_to_25_0FINAL assume true; 25644#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25643#func_to_recursive_line_25_to_25_0FINAL assume true; 25642#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25641#func_to_recursive_line_25_to_25_0FINAL assume true; 25640#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25639#func_to_recursive_line_25_to_25_0FINAL assume true; 25638#func_to_recursive_line_25_to_25_0EXIT >#49#return; 25637#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 25615#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 25627#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 25613#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 25616#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 25624#func_to_recursive_line_25_to_25_0FINAL assume true; 25626#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25634#func_to_recursive_line_25_to_25_0FINAL assume true; 25651#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25649#func_to_recursive_line_25_to_25_0FINAL assume true; 25646#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25645#func_to_recursive_line_25_to_25_0FINAL assume true; 25644#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25643#func_to_recursive_line_25_to_25_0FINAL assume true; 25642#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25641#func_to_recursive_line_25_to_25_0FINAL assume true; 25640#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25639#func_to_recursive_line_25_to_25_0FINAL assume true; 25638#func_to_recursive_line_25_to_25_0EXIT >#49#return; 25637#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 25615#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 25627#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 25613#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 25616#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 25624#func_to_recursive_line_25_to_25_0FINAL assume true; 25626#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25634#func_to_recursive_line_25_to_25_0FINAL assume true; 25651#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25649#func_to_recursive_line_25_to_25_0FINAL assume true; 25646#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25645#func_to_recursive_line_25_to_25_0FINAL assume true; 25644#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25643#func_to_recursive_line_25_to_25_0FINAL assume true; 25642#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25641#func_to_recursive_line_25_to_25_0FINAL assume true; 25640#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25639#func_to_recursive_line_25_to_25_0FINAL assume true; 25638#func_to_recursive_line_25_to_25_0EXIT >#49#return; 25637#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 25615#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 25627#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 25613#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 25616#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 25624#func_to_recursive_line_25_to_25_0FINAL assume true; 25626#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25634#func_to_recursive_line_25_to_25_0FINAL assume true; 25651#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25649#func_to_recursive_line_25_to_25_0FINAL assume true; 25646#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25645#func_to_recursive_line_25_to_25_0FINAL assume true; 25644#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25643#func_to_recursive_line_25_to_25_0FINAL assume true; 25642#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25641#func_to_recursive_line_25_to_25_0FINAL assume true; 25640#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25639#func_to_recursive_line_25_to_25_0FINAL assume true; 25638#func_to_recursive_line_25_to_25_0EXIT >#49#return; 25637#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 25615#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 25627#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 25613#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 25616#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 25625#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 25628#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 25635#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 25624#func_to_recursive_line_25_to_25_0FINAL assume true; 25626#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25634#func_to_recursive_line_25_to_25_0FINAL assume true; 25651#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25649#func_to_recursive_line_25_to_25_0FINAL assume true; 25646#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25645#func_to_recursive_line_25_to_25_0FINAL assume true; 25644#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25643#func_to_recursive_line_25_to_25_0FINAL assume true; 25642#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25641#func_to_recursive_line_25_to_25_0FINAL assume true; 25640#func_to_recursive_line_25_to_25_0EXIT >#59#return; 25639#func_to_recursive_line_25_to_25_0FINAL assume true; 25638#func_to_recursive_line_25_to_25_0EXIT >#49#return; 25637#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 25615#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 25627#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 25613#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 25617#func_to_recursive_line_24_to_25_0FINAL assume true; 25623#func_to_recursive_line_24_to_25_0EXIT >#47#return; 25636#func_to_recursive_line_24_to_25_0FINAL assume true; 25664#func_to_recursive_line_24_to_25_0EXIT >#47#return; 25663#func_to_recursive_line_24_to_25_0FINAL assume true; 25662#func_to_recursive_line_24_to_25_0EXIT >#47#return; 25661#func_to_recursive_line_24_to_25_0FINAL assume true; 25660#func_to_recursive_line_24_to_25_0EXIT >#47#return; 25659#func_to_recursive_line_24_to_25_0FINAL assume true; 25658#func_to_recursive_line_24_to_25_0EXIT >#47#return; 25657#func_to_recursive_line_24_to_25_0FINAL assume true; 25656#func_to_recursive_line_24_to_25_0EXIT >#47#return; 25655#func_to_recursive_line_24_to_25_0FINAL assume true; 25654#func_to_recursive_line_24_to_25_0EXIT >#53#return; 25630#L67 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 25610#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 25612#func_to_recursive_line_23_to_24_0ENTRY ~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#4(~b.base, ~b.offset, 4); 25631#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 25608#func_to_recursive_line_23_to_24_0FINAL assume true; 25611#func_to_recursive_line_23_to_24_0EXIT >#51#return; 25621#func_to_recursive_line_23_to_24_0FINAL assume true; 25653#func_to_recursive_line_23_to_24_0EXIT >#51#return; 25652#func_to_recursive_line_23_to_24_0FINAL assume true; 25650#func_to_recursive_line_23_to_24_0EXIT >#51#return; 25648#func_to_recursive_line_23_to_24_0FINAL assume true; 25647#func_to_recursive_line_23_to_24_0EXIT >#57#return; 25629#L87 call #t~mem14 := read~int#1(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 25618#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);< 25620#func_to_recursive_line_22_to_23_0ENTRY [2024-11-10 23:19:35,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:19:35,002 INFO L85 PathProgramCache]: Analyzing trace with hash 73468, now seen corresponding path program 12 times [2024-11-10 23:19:35,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:19:35,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995617209] [2024-11-10 23:19:35,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:19:35,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:19:35,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:19:35,012 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:19:35,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:19:35,023 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:19:35,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:19:35,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1509596271, now seen corresponding path program 9 times [2024-11-10 23:19:35,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:19:35,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045011657] [2024-11-10 23:19:35,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:19:35,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:19:35,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:37,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:37,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:39,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:39,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:39,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:39,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:39,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:39,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:39,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:39,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:39,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:39,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:39,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:39,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:39,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:39,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:39,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:39,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:39,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:39,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:39,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:39,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:39,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:39,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:39,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:39,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:39,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:39,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:39,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:39,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:39,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-10 23:19:40,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:41,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:41,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:41,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:41,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:41,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:41,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:41,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:41,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:41,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:41,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:41,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:41,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:41,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:41,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:41,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:41,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:41,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:41,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:41,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:41,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:41,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:41,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:41,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:41,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:41,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:41,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:41,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:41,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:41,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:41,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:41,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:41,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:41,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:41,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:41,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:41,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:41,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:41,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:41,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:41,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:41,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:41,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:41,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:41,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:41,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:41,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:41,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:41,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:41,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:41,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:41,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:41,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:41,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:41,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:41,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:41,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:41,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:41,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:41,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:41,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:41,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:41,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:42,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-10 23:19:42,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:42,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:42,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:42,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:42,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:42,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-10 23:19:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:43,001 INFO L134 CoverageAnalysis]: Checked inductivity of 38610 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 38587 trivial. 0 not checked. [2024-11-10 23:19:43,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:19:43,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045011657] [2024-11-10 23:19:43,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045011657] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 23:19:43,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710769920] [2024-11-10 23:19:43,001 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 23:19:43,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 23:19:43,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:19:43,003 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 23:19:43,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-10 23:19:43,527 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-10 23:19:43,528 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 23:19:43,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-10 23:19:43,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:19:43,544 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-10 23:19:43,715 INFO L134 CoverageAnalysis]: Checked inductivity of 38610 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 38595 trivial. 0 not checked. [2024-11-10 23:19:43,715 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 23:19:46,089 INFO L134 CoverageAnalysis]: Checked inductivity of 38610 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 38577 trivial. 0 not checked. [2024-11-10 23:19:46,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710769920] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 23:19:46,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 23:19:46,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 18] total 37 [2024-11-10 23:19:46,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425848203] [2024-11-10 23:19:46,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 23:19:46,094 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:19:46,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:19:46,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-10 23:19:46,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=1095, Unknown=0, NotChecked=0, Total=1332 [2024-11-10 23:19:46,095 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. cyclomatic complexity: 10 Second operand has 37 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 29 states have internal predecessors, (48), 15 states have call successors, (22), 10 states have call predecessors, (22), 10 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2024-11-10 23:19:46,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:19:46,488 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2024-11-10 23:19:46,488 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 67 transitions. [2024-11-10 23:19:46,490 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-10 23:19:46,491 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 61 states and 67 transitions. [2024-11-10 23:19:46,491 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2024-11-10 23:19:46,491 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2024-11-10 23:19:46,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 67 transitions. [2024-11-10 23:19:46,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:19:46,491 INFO L218 hiAutomatonCegarLoop]: Abstraction has 61 states and 67 transitions. [2024-11-10 23:19:46,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 67 transitions. [2024-11-10 23:19:46,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-10 23:19:46,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 36 states have internal predecessors, (36), 8 states have call successors, (8), 4 states have call predecessors, (8), 20 states have return successors, (23), 20 states have call predecessors, (23), 6 states have call successors, (23) [2024-11-10 23:19:46,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2024-11-10 23:19:46,494 INFO L240 hiAutomatonCegarLoop]: Abstraction has 61 states and 67 transitions. [2024-11-10 23:19:46,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 23:19:46,496 INFO L425 stractBuchiCegarLoop]: Abstraction has 61 states and 67 transitions. [2024-11-10 23:19:46,496 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-10 23:19:46,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 67 transitions. [2024-11-10 23:19:46,498 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-10 23:19:46,498 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:19:46,498 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:19:46,501 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-10 23:19:46,501 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [210, 210, 180, 180, 180, 35, 35, 30, 30, 30, 30, 30, 30, 30, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:19:46,501 INFO L745 eck$LassoCheckResult]: Stem: 37099#ULTIMATE.startENTRY 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); 37100#ULTIMATE.init_returnLabel#1 assume true;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#1(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#4(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#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 37086#L107-1 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);< 37087#func_to_recursive_line_22_to_23_0ENTRY [2024-11-10 23:19:46,502 INFO L747 eck$LassoCheckResult]: Loop: 37087#func_to_recursive_line_22_to_23_0ENTRY ~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#1(~a.base, ~a.offset, 4); 37089#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#4(0, ~b.base, ~b.offset, 4); 37076#L87-1 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 37079#func_to_recursive_line_23_to_24_0ENTRY ~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#4(~b.base, ~b.offset, 4); 37098#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 37081#L67-1 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 37094#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 37080#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 37083#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 37091#func_to_recursive_line_25_to_25_0FINAL assume true; 37093#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37101#func_to_recursive_line_25_to_25_0FINAL assume true; 37118#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37116#func_to_recursive_line_25_to_25_0FINAL assume true; 37113#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37112#func_to_recursive_line_25_to_25_0FINAL assume true; 37111#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37110#func_to_recursive_line_25_to_25_0FINAL assume true; 37109#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37108#func_to_recursive_line_25_to_25_0FINAL assume true; 37107#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37106#func_to_recursive_line_25_to_25_0FINAL assume true; 37105#func_to_recursive_line_25_to_25_0EXIT >#49#return; 37104#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 37082#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 37094#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 37080#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 37083#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 37091#func_to_recursive_line_25_to_25_0FINAL assume true; 37093#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37101#func_to_recursive_line_25_to_25_0FINAL assume true; 37118#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37116#func_to_recursive_line_25_to_25_0FINAL assume true; 37113#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37112#func_to_recursive_line_25_to_25_0FINAL assume true; 37111#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37110#func_to_recursive_line_25_to_25_0FINAL assume true; 37109#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37108#func_to_recursive_line_25_to_25_0FINAL assume true; 37107#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37106#func_to_recursive_line_25_to_25_0FINAL assume true; 37105#func_to_recursive_line_25_to_25_0EXIT >#49#return; 37104#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 37082#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 37094#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 37080#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 37083#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 37091#func_to_recursive_line_25_to_25_0FINAL assume true; 37093#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37101#func_to_recursive_line_25_to_25_0FINAL assume true; 37118#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37116#func_to_recursive_line_25_to_25_0FINAL assume true; 37113#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37112#func_to_recursive_line_25_to_25_0FINAL assume true; 37111#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37110#func_to_recursive_line_25_to_25_0FINAL assume true; 37109#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37108#func_to_recursive_line_25_to_25_0FINAL assume true; 37107#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37106#func_to_recursive_line_25_to_25_0FINAL assume true; 37105#func_to_recursive_line_25_to_25_0EXIT >#49#return; 37104#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 37082#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 37094#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 37080#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 37083#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 37091#func_to_recursive_line_25_to_25_0FINAL assume true; 37093#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37101#func_to_recursive_line_25_to_25_0FINAL assume true; 37118#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37116#func_to_recursive_line_25_to_25_0FINAL assume true; 37113#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37112#func_to_recursive_line_25_to_25_0FINAL assume true; 37111#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37110#func_to_recursive_line_25_to_25_0FINAL assume true; 37109#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37108#func_to_recursive_line_25_to_25_0FINAL assume true; 37107#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37106#func_to_recursive_line_25_to_25_0FINAL assume true; 37105#func_to_recursive_line_25_to_25_0EXIT >#49#return; 37104#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 37082#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 37094#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 37080#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 37083#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 37091#func_to_recursive_line_25_to_25_0FINAL assume true; 37093#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37101#func_to_recursive_line_25_to_25_0FINAL assume true; 37118#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37116#func_to_recursive_line_25_to_25_0FINAL assume true; 37113#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37112#func_to_recursive_line_25_to_25_0FINAL assume true; 37111#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37110#func_to_recursive_line_25_to_25_0FINAL assume true; 37109#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37108#func_to_recursive_line_25_to_25_0FINAL assume true; 37107#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37106#func_to_recursive_line_25_to_25_0FINAL assume true; 37105#func_to_recursive_line_25_to_25_0EXIT >#49#return; 37104#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 37082#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 37094#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 37080#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 37083#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 37091#func_to_recursive_line_25_to_25_0FINAL assume true; 37093#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37101#func_to_recursive_line_25_to_25_0FINAL assume true; 37118#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37116#func_to_recursive_line_25_to_25_0FINAL assume true; 37113#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37112#func_to_recursive_line_25_to_25_0FINAL assume true; 37111#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37110#func_to_recursive_line_25_to_25_0FINAL assume true; 37109#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37108#func_to_recursive_line_25_to_25_0FINAL assume true; 37107#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37106#func_to_recursive_line_25_to_25_0FINAL assume true; 37105#func_to_recursive_line_25_to_25_0EXIT >#49#return; 37104#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 37082#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 37094#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 37080#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 37084#func_to_recursive_line_24_to_25_0FINAL assume true; 37090#func_to_recursive_line_24_to_25_0EXIT >#47#return; 37103#func_to_recursive_line_24_to_25_0FINAL assume true; 37135#func_to_recursive_line_24_to_25_0EXIT >#47#return; 37134#func_to_recursive_line_24_to_25_0FINAL assume true; 37133#func_to_recursive_line_24_to_25_0EXIT >#47#return; 37132#func_to_recursive_line_24_to_25_0FINAL assume true; 37131#func_to_recursive_line_24_to_25_0EXIT >#47#return; 37130#func_to_recursive_line_24_to_25_0FINAL assume true; 37129#func_to_recursive_line_24_to_25_0EXIT >#47#return; 37128#func_to_recursive_line_24_to_25_0FINAL assume true; 37127#func_to_recursive_line_24_to_25_0EXIT >#47#return; 37126#func_to_recursive_line_24_to_25_0FINAL assume true; 37125#func_to_recursive_line_24_to_25_0EXIT >#53#return; 37097#L67 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 37077#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 37079#func_to_recursive_line_23_to_24_0ENTRY ~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#4(~b.base, ~b.offset, 4); 37098#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 37081#L67-1 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 37094#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 37080#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 37083#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 37091#func_to_recursive_line_25_to_25_0FINAL assume true; 37093#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37101#func_to_recursive_line_25_to_25_0FINAL assume true; 37118#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37116#func_to_recursive_line_25_to_25_0FINAL assume true; 37113#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37112#func_to_recursive_line_25_to_25_0FINAL assume true; 37111#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37110#func_to_recursive_line_25_to_25_0FINAL assume true; 37109#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37108#func_to_recursive_line_25_to_25_0FINAL assume true; 37107#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37106#func_to_recursive_line_25_to_25_0FINAL assume true; 37105#func_to_recursive_line_25_to_25_0EXIT >#49#return; 37104#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 37082#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 37094#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 37080#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 37083#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 37091#func_to_recursive_line_25_to_25_0FINAL assume true; 37093#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37101#func_to_recursive_line_25_to_25_0FINAL assume true; 37118#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37116#func_to_recursive_line_25_to_25_0FINAL assume true; 37113#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37112#func_to_recursive_line_25_to_25_0FINAL assume true; 37111#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37110#func_to_recursive_line_25_to_25_0FINAL assume true; 37109#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37108#func_to_recursive_line_25_to_25_0FINAL assume true; 37107#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37106#func_to_recursive_line_25_to_25_0FINAL assume true; 37105#func_to_recursive_line_25_to_25_0EXIT >#49#return; 37104#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 37082#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 37094#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 37080#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 37083#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 37091#func_to_recursive_line_25_to_25_0FINAL assume true; 37093#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37101#func_to_recursive_line_25_to_25_0FINAL assume true; 37118#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37116#func_to_recursive_line_25_to_25_0FINAL assume true; 37113#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37112#func_to_recursive_line_25_to_25_0FINAL assume true; 37111#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37110#func_to_recursive_line_25_to_25_0FINAL assume true; 37109#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37108#func_to_recursive_line_25_to_25_0FINAL assume true; 37107#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37106#func_to_recursive_line_25_to_25_0FINAL assume true; 37105#func_to_recursive_line_25_to_25_0EXIT >#49#return; 37104#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 37082#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 37094#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 37080#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 37083#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 37091#func_to_recursive_line_25_to_25_0FINAL assume true; 37093#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37101#func_to_recursive_line_25_to_25_0FINAL assume true; 37118#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37116#func_to_recursive_line_25_to_25_0FINAL assume true; 37113#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37112#func_to_recursive_line_25_to_25_0FINAL assume true; 37111#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37110#func_to_recursive_line_25_to_25_0FINAL assume true; 37109#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37108#func_to_recursive_line_25_to_25_0FINAL assume true; 37107#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37106#func_to_recursive_line_25_to_25_0FINAL assume true; 37105#func_to_recursive_line_25_to_25_0EXIT >#49#return; 37104#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 37082#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 37094#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 37080#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 37083#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 37091#func_to_recursive_line_25_to_25_0FINAL assume true; 37093#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37101#func_to_recursive_line_25_to_25_0FINAL assume true; 37118#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37116#func_to_recursive_line_25_to_25_0FINAL assume true; 37113#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37112#func_to_recursive_line_25_to_25_0FINAL assume true; 37111#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37110#func_to_recursive_line_25_to_25_0FINAL assume true; 37109#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37108#func_to_recursive_line_25_to_25_0FINAL assume true; 37107#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37106#func_to_recursive_line_25_to_25_0FINAL assume true; 37105#func_to_recursive_line_25_to_25_0EXIT >#49#return; 37104#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 37082#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 37094#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 37080#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 37083#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 37091#func_to_recursive_line_25_to_25_0FINAL assume true; 37093#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37101#func_to_recursive_line_25_to_25_0FINAL assume true; 37118#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37116#func_to_recursive_line_25_to_25_0FINAL assume true; 37113#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37112#func_to_recursive_line_25_to_25_0FINAL assume true; 37111#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37110#func_to_recursive_line_25_to_25_0FINAL assume true; 37109#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37108#func_to_recursive_line_25_to_25_0FINAL assume true; 37107#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37106#func_to_recursive_line_25_to_25_0FINAL assume true; 37105#func_to_recursive_line_25_to_25_0EXIT >#49#return; 37104#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 37082#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 37094#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 37080#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 37084#func_to_recursive_line_24_to_25_0FINAL assume true; 37090#func_to_recursive_line_24_to_25_0EXIT >#47#return; 37103#func_to_recursive_line_24_to_25_0FINAL assume true; 37135#func_to_recursive_line_24_to_25_0EXIT >#47#return; 37134#func_to_recursive_line_24_to_25_0FINAL assume true; 37133#func_to_recursive_line_24_to_25_0EXIT >#47#return; 37132#func_to_recursive_line_24_to_25_0FINAL assume true; 37131#func_to_recursive_line_24_to_25_0EXIT >#47#return; 37130#func_to_recursive_line_24_to_25_0FINAL assume true; 37129#func_to_recursive_line_24_to_25_0EXIT >#47#return; 37128#func_to_recursive_line_24_to_25_0FINAL assume true; 37127#func_to_recursive_line_24_to_25_0EXIT >#47#return; 37126#func_to_recursive_line_24_to_25_0FINAL assume true; 37125#func_to_recursive_line_24_to_25_0EXIT >#53#return; 37097#L67 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 37077#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 37079#func_to_recursive_line_23_to_24_0ENTRY ~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#4(~b.base, ~b.offset, 4); 37098#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 37081#L67-1 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 37094#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 37080#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 37083#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 37091#func_to_recursive_line_25_to_25_0FINAL assume true; 37093#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37101#func_to_recursive_line_25_to_25_0FINAL assume true; 37118#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37116#func_to_recursive_line_25_to_25_0FINAL assume true; 37113#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37112#func_to_recursive_line_25_to_25_0FINAL assume true; 37111#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37110#func_to_recursive_line_25_to_25_0FINAL assume true; 37109#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37108#func_to_recursive_line_25_to_25_0FINAL assume true; 37107#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37106#func_to_recursive_line_25_to_25_0FINAL assume true; 37105#func_to_recursive_line_25_to_25_0EXIT >#49#return; 37104#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 37082#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 37094#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 37080#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 37083#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 37091#func_to_recursive_line_25_to_25_0FINAL assume true; 37093#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37101#func_to_recursive_line_25_to_25_0FINAL assume true; 37118#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37116#func_to_recursive_line_25_to_25_0FINAL assume true; 37113#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37112#func_to_recursive_line_25_to_25_0FINAL assume true; 37111#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37110#func_to_recursive_line_25_to_25_0FINAL assume true; 37109#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37108#func_to_recursive_line_25_to_25_0FINAL assume true; 37107#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37106#func_to_recursive_line_25_to_25_0FINAL assume true; 37105#func_to_recursive_line_25_to_25_0EXIT >#49#return; 37104#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 37082#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 37094#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 37080#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 37083#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 37091#func_to_recursive_line_25_to_25_0FINAL assume true; 37093#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37101#func_to_recursive_line_25_to_25_0FINAL assume true; 37118#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37116#func_to_recursive_line_25_to_25_0FINAL assume true; 37113#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37112#func_to_recursive_line_25_to_25_0FINAL assume true; 37111#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37110#func_to_recursive_line_25_to_25_0FINAL assume true; 37109#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37108#func_to_recursive_line_25_to_25_0FINAL assume true; 37107#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37106#func_to_recursive_line_25_to_25_0FINAL assume true; 37105#func_to_recursive_line_25_to_25_0EXIT >#49#return; 37104#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 37082#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 37094#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 37080#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 37083#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 37091#func_to_recursive_line_25_to_25_0FINAL assume true; 37093#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37101#func_to_recursive_line_25_to_25_0FINAL assume true; 37118#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37116#func_to_recursive_line_25_to_25_0FINAL assume true; 37113#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37112#func_to_recursive_line_25_to_25_0FINAL assume true; 37111#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37110#func_to_recursive_line_25_to_25_0FINAL assume true; 37109#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37108#func_to_recursive_line_25_to_25_0FINAL assume true; 37107#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37106#func_to_recursive_line_25_to_25_0FINAL assume true; 37105#func_to_recursive_line_25_to_25_0EXIT >#49#return; 37104#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 37082#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 37094#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 37080#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 37083#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 37091#func_to_recursive_line_25_to_25_0FINAL assume true; 37093#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37101#func_to_recursive_line_25_to_25_0FINAL assume true; 37118#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37116#func_to_recursive_line_25_to_25_0FINAL assume true; 37113#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37112#func_to_recursive_line_25_to_25_0FINAL assume true; 37111#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37110#func_to_recursive_line_25_to_25_0FINAL assume true; 37109#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37108#func_to_recursive_line_25_to_25_0FINAL assume true; 37107#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37106#func_to_recursive_line_25_to_25_0FINAL assume true; 37105#func_to_recursive_line_25_to_25_0EXIT >#49#return; 37104#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 37082#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 37094#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 37080#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 37083#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 37091#func_to_recursive_line_25_to_25_0FINAL assume true; 37093#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37101#func_to_recursive_line_25_to_25_0FINAL assume true; 37118#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37116#func_to_recursive_line_25_to_25_0FINAL assume true; 37113#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37112#func_to_recursive_line_25_to_25_0FINAL assume true; 37111#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37110#func_to_recursive_line_25_to_25_0FINAL assume true; 37109#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37108#func_to_recursive_line_25_to_25_0FINAL assume true; 37107#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37106#func_to_recursive_line_25_to_25_0FINAL assume true; 37105#func_to_recursive_line_25_to_25_0EXIT >#49#return; 37104#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 37082#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 37094#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 37080#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 37084#func_to_recursive_line_24_to_25_0FINAL assume true; 37090#func_to_recursive_line_24_to_25_0EXIT >#47#return; 37103#func_to_recursive_line_24_to_25_0FINAL assume true; 37135#func_to_recursive_line_24_to_25_0EXIT >#47#return; 37134#func_to_recursive_line_24_to_25_0FINAL assume true; 37133#func_to_recursive_line_24_to_25_0EXIT >#47#return; 37132#func_to_recursive_line_24_to_25_0FINAL assume true; 37131#func_to_recursive_line_24_to_25_0EXIT >#47#return; 37130#func_to_recursive_line_24_to_25_0FINAL assume true; 37129#func_to_recursive_line_24_to_25_0EXIT >#47#return; 37128#func_to_recursive_line_24_to_25_0FINAL assume true; 37127#func_to_recursive_line_24_to_25_0EXIT >#47#return; 37126#func_to_recursive_line_24_to_25_0FINAL assume true; 37125#func_to_recursive_line_24_to_25_0EXIT >#53#return; 37097#L67 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 37077#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 37079#func_to_recursive_line_23_to_24_0ENTRY ~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#4(~b.base, ~b.offset, 4); 37098#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 37081#L67-1 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 37094#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 37080#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 37083#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 37091#func_to_recursive_line_25_to_25_0FINAL assume true; 37093#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37101#func_to_recursive_line_25_to_25_0FINAL assume true; 37118#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37116#func_to_recursive_line_25_to_25_0FINAL assume true; 37113#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37112#func_to_recursive_line_25_to_25_0FINAL assume true; 37111#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37110#func_to_recursive_line_25_to_25_0FINAL assume true; 37109#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37108#func_to_recursive_line_25_to_25_0FINAL assume true; 37107#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37106#func_to_recursive_line_25_to_25_0FINAL assume true; 37105#func_to_recursive_line_25_to_25_0EXIT >#49#return; 37104#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 37082#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 37094#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 37080#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 37083#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 37091#func_to_recursive_line_25_to_25_0FINAL assume true; 37093#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37101#func_to_recursive_line_25_to_25_0FINAL assume true; 37118#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37116#func_to_recursive_line_25_to_25_0FINAL assume true; 37113#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37112#func_to_recursive_line_25_to_25_0FINAL assume true; 37111#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37110#func_to_recursive_line_25_to_25_0FINAL assume true; 37109#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37108#func_to_recursive_line_25_to_25_0FINAL assume true; 37107#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37106#func_to_recursive_line_25_to_25_0FINAL assume true; 37105#func_to_recursive_line_25_to_25_0EXIT >#49#return; 37104#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 37082#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 37094#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 37080#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 37083#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 37091#func_to_recursive_line_25_to_25_0FINAL assume true; 37093#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37101#func_to_recursive_line_25_to_25_0FINAL assume true; 37118#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37116#func_to_recursive_line_25_to_25_0FINAL assume true; 37113#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37112#func_to_recursive_line_25_to_25_0FINAL assume true; 37111#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37110#func_to_recursive_line_25_to_25_0FINAL assume true; 37109#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37108#func_to_recursive_line_25_to_25_0FINAL assume true; 37107#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37106#func_to_recursive_line_25_to_25_0FINAL assume true; 37105#func_to_recursive_line_25_to_25_0EXIT >#49#return; 37104#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 37082#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 37094#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 37080#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 37083#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 37091#func_to_recursive_line_25_to_25_0FINAL assume true; 37093#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37101#func_to_recursive_line_25_to_25_0FINAL assume true; 37118#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37116#func_to_recursive_line_25_to_25_0FINAL assume true; 37113#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37112#func_to_recursive_line_25_to_25_0FINAL assume true; 37111#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37110#func_to_recursive_line_25_to_25_0FINAL assume true; 37109#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37108#func_to_recursive_line_25_to_25_0FINAL assume true; 37107#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37106#func_to_recursive_line_25_to_25_0FINAL assume true; 37105#func_to_recursive_line_25_to_25_0EXIT >#49#return; 37104#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 37082#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 37094#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 37080#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 37083#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 37091#func_to_recursive_line_25_to_25_0FINAL assume true; 37093#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37101#func_to_recursive_line_25_to_25_0FINAL assume true; 37118#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37116#func_to_recursive_line_25_to_25_0FINAL assume true; 37113#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37112#func_to_recursive_line_25_to_25_0FINAL assume true; 37111#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37110#func_to_recursive_line_25_to_25_0FINAL assume true; 37109#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37108#func_to_recursive_line_25_to_25_0FINAL assume true; 37107#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37106#func_to_recursive_line_25_to_25_0FINAL assume true; 37105#func_to_recursive_line_25_to_25_0EXIT >#49#return; 37104#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 37082#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 37094#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 37080#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 37083#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 37091#func_to_recursive_line_25_to_25_0FINAL assume true; 37093#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37101#func_to_recursive_line_25_to_25_0FINAL assume true; 37118#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37116#func_to_recursive_line_25_to_25_0FINAL assume true; 37113#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37112#func_to_recursive_line_25_to_25_0FINAL assume true; 37111#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37110#func_to_recursive_line_25_to_25_0FINAL assume true; 37109#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37108#func_to_recursive_line_25_to_25_0FINAL assume true; 37107#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37106#func_to_recursive_line_25_to_25_0FINAL assume true; 37105#func_to_recursive_line_25_to_25_0EXIT >#49#return; 37104#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 37082#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 37094#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 37080#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 37084#func_to_recursive_line_24_to_25_0FINAL assume true; 37090#func_to_recursive_line_24_to_25_0EXIT >#47#return; 37103#func_to_recursive_line_24_to_25_0FINAL assume true; 37135#func_to_recursive_line_24_to_25_0EXIT >#47#return; 37134#func_to_recursive_line_24_to_25_0FINAL assume true; 37133#func_to_recursive_line_24_to_25_0EXIT >#47#return; 37132#func_to_recursive_line_24_to_25_0FINAL assume true; 37131#func_to_recursive_line_24_to_25_0EXIT >#47#return; 37130#func_to_recursive_line_24_to_25_0FINAL assume true; 37129#func_to_recursive_line_24_to_25_0EXIT >#47#return; 37128#func_to_recursive_line_24_to_25_0FINAL assume true; 37127#func_to_recursive_line_24_to_25_0EXIT >#47#return; 37126#func_to_recursive_line_24_to_25_0FINAL assume true; 37125#func_to_recursive_line_24_to_25_0EXIT >#53#return; 37097#L67 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 37077#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 37079#func_to_recursive_line_23_to_24_0ENTRY ~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#4(~b.base, ~b.offset, 4); 37098#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 37081#L67-1 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 37094#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 37080#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 37083#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 37091#func_to_recursive_line_25_to_25_0FINAL assume true; 37093#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37101#func_to_recursive_line_25_to_25_0FINAL assume true; 37118#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37116#func_to_recursive_line_25_to_25_0FINAL assume true; 37113#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37112#func_to_recursive_line_25_to_25_0FINAL assume true; 37111#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37110#func_to_recursive_line_25_to_25_0FINAL assume true; 37109#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37108#func_to_recursive_line_25_to_25_0FINAL assume true; 37107#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37106#func_to_recursive_line_25_to_25_0FINAL assume true; 37105#func_to_recursive_line_25_to_25_0EXIT >#49#return; 37104#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 37082#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 37094#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 37080#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 37083#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 37091#func_to_recursive_line_25_to_25_0FINAL assume true; 37093#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37101#func_to_recursive_line_25_to_25_0FINAL assume true; 37118#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37116#func_to_recursive_line_25_to_25_0FINAL assume true; 37113#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37112#func_to_recursive_line_25_to_25_0FINAL assume true; 37111#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37110#func_to_recursive_line_25_to_25_0FINAL assume true; 37109#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37108#func_to_recursive_line_25_to_25_0FINAL assume true; 37107#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37106#func_to_recursive_line_25_to_25_0FINAL assume true; 37105#func_to_recursive_line_25_to_25_0EXIT >#49#return; 37104#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 37082#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 37094#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 37080#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 37083#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 37091#func_to_recursive_line_25_to_25_0FINAL assume true; 37093#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37101#func_to_recursive_line_25_to_25_0FINAL assume true; 37118#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37116#func_to_recursive_line_25_to_25_0FINAL assume true; 37113#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37112#func_to_recursive_line_25_to_25_0FINAL assume true; 37111#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37110#func_to_recursive_line_25_to_25_0FINAL assume true; 37109#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37108#func_to_recursive_line_25_to_25_0FINAL assume true; 37107#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37106#func_to_recursive_line_25_to_25_0FINAL assume true; 37105#func_to_recursive_line_25_to_25_0EXIT >#49#return; 37104#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 37082#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 37094#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 37080#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 37083#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 37091#func_to_recursive_line_25_to_25_0FINAL assume true; 37093#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37101#func_to_recursive_line_25_to_25_0FINAL assume true; 37118#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37116#func_to_recursive_line_25_to_25_0FINAL assume true; 37113#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37112#func_to_recursive_line_25_to_25_0FINAL assume true; 37111#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37110#func_to_recursive_line_25_to_25_0FINAL assume true; 37109#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37108#func_to_recursive_line_25_to_25_0FINAL assume true; 37107#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37106#func_to_recursive_line_25_to_25_0FINAL assume true; 37105#func_to_recursive_line_25_to_25_0EXIT >#49#return; 37104#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 37082#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 37094#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 37080#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 37083#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 37091#func_to_recursive_line_25_to_25_0FINAL assume true; 37093#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37101#func_to_recursive_line_25_to_25_0FINAL assume true; 37118#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37116#func_to_recursive_line_25_to_25_0FINAL assume true; 37113#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37112#func_to_recursive_line_25_to_25_0FINAL assume true; 37111#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37110#func_to_recursive_line_25_to_25_0FINAL assume true; 37109#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37108#func_to_recursive_line_25_to_25_0FINAL assume true; 37107#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37106#func_to_recursive_line_25_to_25_0FINAL assume true; 37105#func_to_recursive_line_25_to_25_0EXIT >#49#return; 37104#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 37082#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 37094#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 37080#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4); 37083#L47-1 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 37092#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 37095#func_to_recursive_line_25_to_25_0ENTRY ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4); 37102#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 37091#func_to_recursive_line_25_to_25_0FINAL assume true; 37093#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37101#func_to_recursive_line_25_to_25_0FINAL assume true; 37118#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37116#func_to_recursive_line_25_to_25_0FINAL assume true; 37113#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37112#func_to_recursive_line_25_to_25_0FINAL assume true; 37111#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37110#func_to_recursive_line_25_to_25_0FINAL assume true; 37109#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37108#func_to_recursive_line_25_to_25_0FINAL assume true; 37107#func_to_recursive_line_25_to_25_0EXIT >#59#return; 37106#func_to_recursive_line_25_to_25_0FINAL assume true; 37105#func_to_recursive_line_25_to_25_0EXIT >#49#return; 37104#L47 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 37082#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 37094#func_to_recursive_line_24_to_25_0ENTRY ~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#3(~c.base, ~c.offset, 4); 37080#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 37084#func_to_recursive_line_24_to_25_0FINAL assume true; 37090#func_to_recursive_line_24_to_25_0EXIT >#47#return; 37103#func_to_recursive_line_24_to_25_0FINAL assume true; 37135#func_to_recursive_line_24_to_25_0EXIT >#47#return; 37134#func_to_recursive_line_24_to_25_0FINAL assume true; 37133#func_to_recursive_line_24_to_25_0EXIT >#47#return; 37132#func_to_recursive_line_24_to_25_0FINAL assume true; 37131#func_to_recursive_line_24_to_25_0EXIT >#47#return; 37130#func_to_recursive_line_24_to_25_0FINAL assume true; 37129#func_to_recursive_line_24_to_25_0EXIT >#47#return; 37128#func_to_recursive_line_24_to_25_0FINAL assume true; 37127#func_to_recursive_line_24_to_25_0EXIT >#47#return; 37126#func_to_recursive_line_24_to_25_0FINAL assume true; 37125#func_to_recursive_line_24_to_25_0EXIT >#53#return; 37097#L67 call #t~mem11 := read~int#4(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#4(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 37077#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 37079#func_to_recursive_line_23_to_24_0ENTRY ~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#4(~b.base, ~b.offset, 4); 37098#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 37075#func_to_recursive_line_23_to_24_0FINAL assume true; 37078#func_to_recursive_line_23_to_24_0EXIT >#51#return; 37088#func_to_recursive_line_23_to_24_0FINAL assume true; 37124#func_to_recursive_line_23_to_24_0EXIT >#51#return; 37123#func_to_recursive_line_23_to_24_0FINAL assume true; 37122#func_to_recursive_line_23_to_24_0EXIT >#51#return; 37121#func_to_recursive_line_23_to_24_0FINAL assume true; 37120#func_to_recursive_line_23_to_24_0EXIT >#51#return; 37119#func_to_recursive_line_23_to_24_0FINAL assume true; 37117#func_to_recursive_line_23_to_24_0EXIT >#51#return; 37115#func_to_recursive_line_23_to_24_0FINAL assume true; 37114#func_to_recursive_line_23_to_24_0EXIT >#57#return; 37096#L87 call #t~mem14 := read~int#1(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 37085#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);< 37087#func_to_recursive_line_22_to_23_0ENTRY [2024-11-10 23:19:46,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:19:46,504 INFO L85 PathProgramCache]: Analyzing trace with hash 73468, now seen corresponding path program 13 times [2024-11-10 23:19:46,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:19:46,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457050866] [2024-11-10 23:19:46,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:19:46,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:19:46,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:19:46,514 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:19:46,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:19:46,522 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:19:46,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:19:46,523 INFO L85 PathProgramCache]: Analyzing trace with hash -528204613, now seen corresponding path program 10 times [2024-11-10 23:19:46,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:19:46,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567849587] [2024-11-10 23:19:46,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:19:46,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:19:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:52,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:52,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:58,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:58,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:58,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:58,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:58,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:58,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:58,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:58,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:58,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:58,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:58,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:58,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:58,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:58,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:58,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:58,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:58,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:58,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:58,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:58,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:58,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:58,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:58,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:58,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:58,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:58,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:58,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:58,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:58,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:58,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:58,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:58,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:58,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:58,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:58,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:58,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-10 23:20:00,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:20:08,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:20:08,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:20:08,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:20:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:20:08,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:20:08,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-10 23:20:08,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:20:11,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:20:11,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:20:11,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:20:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:20:11,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:20:11,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-10 23:20:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat