./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 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_5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 23:18:53,444 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 23:18:53,530 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:53,536 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 23:18:53,537 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 23:18:53,537 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-10 23:18:53,569 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 23:18:53,570 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 23:18:53,571 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 23:18:53,572 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 23:18:53,572 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 23:18:53,573 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 23:18:53,574 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 23:18:53,576 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 23:18:53,576 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-10 23:18:53,576 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-10 23:18:53,577 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-10 23:18:53,577 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-10 23:18:53,577 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-10 23:18:53,577 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-10 23:18:53,577 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 23:18:53,581 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-10 23:18:53,581 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 23:18:53,582 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 23:18:53,582 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 23:18:53,582 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 23:18:53,582 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-10 23:18:53,583 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-10 23:18:53,583 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-10 23:18:53,583 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 23:18:53,584 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 23:18:53,584 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 23:18:53,584 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 23:18:53,585 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-10 23:18:53,585 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 23:18:53,585 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 23:18:53,585 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 23:18:53,585 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 23:18:53,586 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 23:18:53,586 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-10 23:18:53,586 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 [2024-11-10 23:18:53,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 23:18:53,868 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 23:18:53,871 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 23:18:53,872 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 23:18:53,873 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 23:18:53,874 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2024-11-10 23:18:55,302 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 23:18:55,501 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 23:18:55,502 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2024-11-10 23:18:55,508 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05f1c378d/776500d9d68d43eabb631f73632360cc/FLAG131fb619b [2024-11-10 23:18:55,895 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05f1c378d/776500d9d68d43eabb631f73632360cc [2024-11-10 23:18:55,901 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 23:18:55,904 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 23:18:55,905 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 23:18:55,905 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 23:18:55,911 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 23:18:55,911 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:18:55" (1/1) ... [2024-11-10 23:18:55,912 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e510434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:18:55, skipping insertion in model container [2024-11-10 23:18:55,912 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:18:55" (1/1) ... [2024-11-10 23:18:55,941 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 23:18:56,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 23:18:56,152 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 23:18:56,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 23:18:56,199 INFO L204 MainTranslator]: Completed translation [2024-11-10 23:18:56,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:18:56 WrapperNode [2024-11-10 23:18:56,200 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 23:18:56,201 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 23:18:56,201 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 23:18:56,201 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 23:18:56,208 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:56" (1/1) ... [2024-11-10 23:18:56,217 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:56" (1/1) ... [2024-11-10 23:18:56,236 INFO L138 Inliner]: procedures = 16, calls = 63, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2024-11-10 23:18:56,236 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 23:18:56,237 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 23:18:56,237 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 23:18:56,237 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 23:18:56,247 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:56" (1/1) ... [2024-11-10 23:18:56,248 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:56" (1/1) ... [2024-11-10 23:18:56,253 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:56" (1/1) ... [2024-11-10 23:18:56,281 INFO L175 MemorySlicer]: Split 32 memory accesses to 6 slices as follows [2, 6, 6, 6, 6, 6]. 19 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 1, 1, 1, 1, 1]. The 10 writes are split as follows [0, 2, 2, 2, 2, 2]. [2024-11-10 23:18:56,284 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:56" (1/1) ... [2024-11-10 23:18:56,284 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:56" (1/1) ... [2024-11-10 23:18:56,294 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:56" (1/1) ... [2024-11-10 23:18:56,295 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:56" (1/1) ... [2024-11-10 23:18:56,297 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:56" (1/1) ... [2024-11-10 23:18:56,298 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:56" (1/1) ... [2024-11-10 23:18:56,301 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 23:18:56,302 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 23:18:56,302 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 23:18:56,302 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 23:18:56,303 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:18:56" (1/1) ... [2024-11-10 23:18:56,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:18:56,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:18:56,343 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:56,347 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:56,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 23:18:56,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 23:18:56,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 23:18:56,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 23:18:56,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-10 23:18:56,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-10 23:18:56,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-10 23:18:56,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 23:18:56,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 23:18:56,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 23:18:56,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 23:18:56,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-10 23:18:56,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-10 23:18:56,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-10 23:18:56,399 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2024-11-10 23:18:56,399 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2024-11-10 23:18:56,400 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2024-11-10 23:18:56,400 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2024-11-10 23:18:56,400 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_26_0 [2024-11-10 23:18:56,400 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_26_0 [2024-11-10 23:18:56,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 23:18:56,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 23:18:56,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 23:18:56,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 23:18:56,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 23:18:56,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-10 23:18:56,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-10 23:18:56,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-10 23:18:56,401 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_27_0 [2024-11-10 23:18:56,401 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_27_0 [2024-11-10 23:18:56,402 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_27_0 [2024-11-10 23:18:56,402 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_27_0 [2024-11-10 23:18:56,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 23:18:56,533 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 23:18:56,535 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 23:18:56,811 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L121: 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;call ULTIMATE.dealloc(main_~#e~0#1.base, main_~#e~0#1.offset);havoc main_~#e~0#1.base, main_~#e~0#1.offset; [2024-11-10 23:18:56,847 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-10 23:18:56,847 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 23:18:56,871 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 23:18:56,871 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 23:18:56,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 11:18:56 BoogieIcfgContainer [2024-11-10 23:18:56,872 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 23:18:56,873 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-10 23:18:56,873 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-10 23:18:56,878 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-10 23:18:56,878 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 23:18:56,879 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 11:18:55" (1/3) ... [2024-11-10 23:18:56,879 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60b40310 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:18:56, skipping insertion in model container [2024-11-10 23:18:56,880 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 23:18:56,880 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:18:56" (2/3) ... [2024-11-10 23:18:56,881 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60b40310 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:18:56, skipping insertion in model container [2024-11-10 23:18:56,882 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 23:18:56,882 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 11:18:56" (3/3) ... [2024-11-10 23:18:56,883 INFO L332 chiAutomizerObserver]: Analyzing ICFG recursified_nested_5.c [2024-11-10 23:18:56,936 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-10 23:18:56,936 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-10 23:18:56,936 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-10 23:18:56,936 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-10 23:18:56,936 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-10 23:18:56,937 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-10 23:18:56,937 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-10 23:18:56,937 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-10 23:18:56,940 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 50 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 39 states have internal predecessors, (44), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 23:18:56,960 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-10 23:18:56,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:18:56,961 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:18:56,967 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-10 23:18:56,967 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:18:56,967 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-10 23:18:56,968 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 50 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 39 states have internal predecessors, (44), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 23:18:56,972 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-10 23:18:56,972 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:18:56,972 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:18:56,973 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-10 23:18:56,973 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:18:56,978 INFO L745 eck$LassoCheckResult]: Stem: 39#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); 19#ULTIMATE.init_returnLabel#1true assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#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#3(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#2(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#5(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 18#L128-1true call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 24#func_to_recursive_line_23_to_24_0ENTRYtrue [2024-11-10 23:18:56,978 INFO L747 eck$LassoCheckResult]: Loop: 24#func_to_recursive_line_23_to_24_0ENTRYtrue ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#1(~a.base, ~a.offset, 4); 5#L101true assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4); 3#L107-1true call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 20#func_to_recursive_line_24_to_25_0ENTRYtrue ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 29#L81true assume !(#t~mem13 < 6);havoc #t~mem13; 30#func_to_recursive_line_24_to_25_0FINALtrue assume true; 22#func_to_recursive_line_24_to_25_0EXITtrue >#73#return; 6#L107true call #t~mem17 := read~int#1(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#1(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 37#L112true call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 24#func_to_recursive_line_23_to_24_0ENTRYtrue [2024-11-10 23:18:56,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:18:56,984 INFO L85 PathProgramCache]: Analyzing trace with hash 83402, now seen corresponding path program 1 times [2024-11-10 23:18:56,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:18:56,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966381982] [2024-11-10 23:18:56,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:18:56,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:18:57,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:18:57,143 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:18:57,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:18:57,222 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:18:57,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:18:57,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1768289610, now seen corresponding path program 1 times [2024-11-10 23:18:57,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:18:57,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847651092] [2024-11-10 23:18:57,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:18:57,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:18:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:57,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:18:57,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:57,676 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:57,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:18:57,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847651092] [2024-11-10 23:18:57,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847651092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 23:18:57,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 23:18:57,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 23:18:57,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599688040] [2024-11-10 23:18:57,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 23:18:57,683 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:18:57,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:18:57,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 23:18:57,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 23:18:57,727 INFO L87 Difference]: Start difference. First operand has 50 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 39 states have internal predecessors, (44), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 23:18:58,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:18:58,140 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2024-11-10 23:18:58,142 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 76 transitions. [2024-11-10 23:18:58,146 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-10 23:18:58,151 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 42 states and 53 transitions. [2024-11-10 23:18:58,152 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-10 23:18:58,153 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-10 23:18:58,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 53 transitions. [2024-11-10 23:18:58,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:18:58,155 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 53 transitions. [2024-11-10 23:18:58,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 53 transitions. [2024-11-10 23:18:58,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2024-11-10 23:18:58,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 25 states have internal predecessors, (25), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-10 23:18:58,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2024-11-10 23:18:58,183 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-11-10 23:18:58,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 23:18:58,188 INFO L425 stractBuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-11-10 23:18:58,189 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-10 23:18:58,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 44 transitions. [2024-11-10 23:18:58,190 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-10 23:18:58,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:18:58,191 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:18:58,191 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-10 23:18:58,192 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:58,192 INFO L745 eck$LassoCheckResult]: Stem: 160#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); 161#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#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#3(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#2(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#5(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 130#L128-1 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 158#func_to_recursive_line_23_to_24_0ENTRY [2024-11-10 23:18:58,192 INFO L747 eck$LassoCheckResult]: Loop: 158#func_to_recursive_line_23_to_24_0ENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#1(~a.base, ~a.offset, 4); 141#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4); 129#L107-1 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 132#func_to_recursive_line_24_to_25_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 137#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4); 139#L87-1 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 157#func_to_recursive_line_25_to_26_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4); 162#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 146#func_to_recursive_line_25_to_26_0FINAL assume true; 144#func_to_recursive_line_25_to_26_0EXIT >#59#return; 147#L87 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 138#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 132#func_to_recursive_line_24_to_25_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 137#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 140#func_to_recursive_line_24_to_25_0FINAL assume true; 143#func_to_recursive_line_24_to_25_0EXIT >#57#return; 163#func_to_recursive_line_24_to_25_0FINAL assume true; 164#func_to_recursive_line_24_to_25_0EXIT >#73#return; 142#L107 call #t~mem17 := read~int#1(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#1(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 131#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 158#func_to_recursive_line_23_to_24_0ENTRY [2024-11-10 23:18:58,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:18:58,193 INFO L85 PathProgramCache]: Analyzing trace with hash 83402, now seen corresponding path program 2 times [2024-11-10 23:18:58,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:18:58,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941870681] [2024-11-10 23:18:58,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:18:58,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:18:58,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:18:58,225 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:18:58,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:18:58,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:18:58,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:18:58,257 INFO L85 PathProgramCache]: Analyzing trace with hash 413766199, now seen corresponding path program 1 times [2024-11-10 23:18:58,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:18:58,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396308821] [2024-11-10 23:18:58,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:18:58,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:18:58,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:58,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:18:58,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:58,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:18:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:58,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 23:18:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:58,600 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:58,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:18:58,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396308821] [2024-11-10 23:18:58,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396308821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 23:18:58,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 23:18:58,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 23:18:58,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758081128] [2024-11-10 23:18:58,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 23:18:58,603 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:18:58,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:18:58,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 23:18:58,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 23:18:58,605 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. cyclomatic complexity: 13 Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 23:18:58,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:18:58,801 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2024-11-10 23:18:58,802 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 52 transitions. [2024-11-10 23:18:58,803 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-10 23:18:58,805 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 52 transitions. [2024-11-10 23:18:58,807 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-10 23:18:58,808 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-10 23:18:58,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 52 transitions. [2024-11-10 23:18:58,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:18:58,808 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 52 transitions. [2024-11-10 23:18:58,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 52 transitions. [2024-11-10 23:18:58,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2024-11-10 23:18:58,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 26 states have internal predecessors, (26), 10 states have call successors, (10), 5 states have call predecessors, (10), 6 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-10 23:18:58,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2024-11-10 23:18:58,815 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 46 transitions. [2024-11-10 23:18:58,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 23:18:58,816 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 46 transitions. [2024-11-10 23:18:58,818 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-10 23:18:58,818 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 46 transitions. [2024-11-10 23:18:58,819 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-10 23:18:58,819 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:18:58,819 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:18:58,820 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-10 23:18:58,822 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:58,822 INFO L745 eck$LassoCheckResult]: Stem: 275#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); 276#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#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#3(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#2(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#5(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 245#L128-1 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 273#func_to_recursive_line_23_to_24_0ENTRY [2024-11-10 23:18:58,822 INFO L747 eck$LassoCheckResult]: Loop: 273#func_to_recursive_line_23_to_24_0ENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#1(~a.base, ~a.offset, 4); 256#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4); 244#L107-1 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 247#func_to_recursive_line_24_to_25_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 252#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4); 254#L87-1 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 272#func_to_recursive_line_25_to_26_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4); 278#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4); 266#L67-1 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 274#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 271#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 265#func_to_recursive_line_26_to_27_0FINAL assume true; 268#func_to_recursive_line_26_to_27_0EXIT >#63#return; 270#L67 call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 260#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 272#func_to_recursive_line_25_to_26_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4); 278#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 269#func_to_recursive_line_25_to_26_0FINAL assume true; 259#func_to_recursive_line_25_to_26_0EXIT >#61#return; 261#func_to_recursive_line_25_to_26_0FINAL assume true; 280#func_to_recursive_line_25_to_26_0EXIT >#59#return; 277#L87 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 253#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 247#func_to_recursive_line_24_to_25_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 252#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 255#func_to_recursive_line_24_to_25_0FINAL assume true; 258#func_to_recursive_line_24_to_25_0EXIT >#57#return; 279#func_to_recursive_line_24_to_25_0FINAL assume true; 281#func_to_recursive_line_24_to_25_0EXIT >#73#return; 257#L107 call #t~mem17 := read~int#1(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#1(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 246#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 273#func_to_recursive_line_23_to_24_0ENTRY [2024-11-10 23:18:58,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:18:58,823 INFO L85 PathProgramCache]: Analyzing trace with hash 83402, now seen corresponding path program 3 times [2024-11-10 23:18:58,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:18:58,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417154913] [2024-11-10 23:18:58,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:18:58,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:18:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:18:58,856 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:18:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:18:58,872 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:18:58,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:18:58,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1401246586, now seen corresponding path program 1 times [2024-11-10 23:18:58,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:18:58,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040980599] [2024-11-10 23:18:58,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:18:58,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:18:58,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:59,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:18:59,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:59,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:18:59,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:59,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:18:59,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:59,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 23:18:59,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:59,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 23:18:59,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:59,329 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:59,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:18:59,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040980599] [2024-11-10 23:18:59,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040980599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 23:18:59,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 23:18:59,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 23:18:59,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959932798] [2024-11-10 23:18:59,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 23:18:59,333 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:18:59,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:18:59,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 23:18:59,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-10 23:18:59,335 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. cyclomatic complexity: 13 Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-10 23:18:59,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:18:59,526 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2024-11-10 23:18:59,526 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 51 transitions. [2024-11-10 23:18:59,529 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-10 23:18:59,533 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 51 transitions. [2024-11-10 23:18:59,533 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-10 23:18:59,534 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-10 23:18:59,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 51 transitions. [2024-11-10 23:18:59,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:18:59,534 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 51 transitions. [2024-11-10 23:18:59,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 51 transitions. [2024-11-10 23:18:59,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2024-11-10 23:18:59,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 23 states have (on average 1.173913043478261) internal successors, (27), 27 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2024-11-10 23:18:59,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2024-11-10 23:18:59,541 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-11-10 23:18:59,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 23:18:59,542 INFO L425 stractBuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-11-10 23:18:59,542 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-10 23:18:59,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 48 transitions. [2024-11-10 23:18:59,543 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-10 23:18:59,544 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:18:59,544 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:18:59,545 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-10 23:18:59,545 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:18:59,545 INFO L745 eck$LassoCheckResult]: Stem: 424#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); 425#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#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#3(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#2(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#5(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 393#L128-1 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 422#func_to_recursive_line_23_to_24_0ENTRY [2024-11-10 23:18:59,546 INFO L747 eck$LassoCheckResult]: Loop: 422#func_to_recursive_line_23_to_24_0ENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#1(~a.base, ~a.offset, 4); 405#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4); 392#L107-1 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 395#func_to_recursive_line_24_to_25_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 400#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4); 402#L87-1 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 421#func_to_recursive_line_25_to_26_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4); 427#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4); 415#L67-1 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 423#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 420#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 398#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 396#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 399#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 411#func_to_recursive_line_27_to_27_0FINAL assume true; 410#func_to_recursive_line_27_to_27_0EXIT >#69#return; 412#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 414#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 423#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 420#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 413#func_to_recursive_line_26_to_27_0FINAL assume true; 416#func_to_recursive_line_26_to_27_0EXIT >#67#return; 419#func_to_recursive_line_26_to_27_0FINAL assume true; 431#func_to_recursive_line_26_to_27_0EXIT >#63#return; 418#L67 call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 408#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 421#func_to_recursive_line_25_to_26_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4); 427#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 417#func_to_recursive_line_25_to_26_0FINAL assume true; 407#func_to_recursive_line_25_to_26_0EXIT >#61#return; 409#func_to_recursive_line_25_to_26_0FINAL assume true; 430#func_to_recursive_line_25_to_26_0EXIT >#59#return; 426#L87 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 401#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 395#func_to_recursive_line_24_to_25_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 400#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 403#func_to_recursive_line_24_to_25_0FINAL assume true; 406#func_to_recursive_line_24_to_25_0EXIT >#57#return; 428#func_to_recursive_line_24_to_25_0FINAL assume true; 429#func_to_recursive_line_24_to_25_0EXIT >#73#return; 404#L107 call #t~mem17 := read~int#1(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#1(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 394#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 422#func_to_recursive_line_23_to_24_0ENTRY [2024-11-10 23:18:59,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:18:59,547 INFO L85 PathProgramCache]: Analyzing trace with hash 83402, now seen corresponding path program 4 times [2024-11-10 23:18:59,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:18:59,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936327796] [2024-11-10 23:18:59,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:18:59,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:18:59,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:18:59,563 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:18:59,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:18:59,579 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:18:59,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:18:59,580 INFO L85 PathProgramCache]: Analyzing trace with hash 197511696, now seen corresponding path program 1 times [2024-11-10 23:18:59,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:18:59,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850428790] [2024-11-10 23:18:59,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:18:59,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:18:59,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:59,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:18:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:59,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:18:59,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:59,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:18:59,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:59,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:18:59,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:00,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 23:19:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:00,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 23:19:00,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:00,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 23:19:00,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:00,030 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 23:19:00,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:19:00,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850428790] [2024-11-10 23:19:00,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850428790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 23:19:00,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 23:19:00,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 23:19:00,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596234191] [2024-11-10 23:19:00,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 23:19:00,032 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:19:00,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:19:00,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 23:19:00,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 23:19:00,033 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. cyclomatic complexity: 13 Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 1 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-10 23:19:00,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:19:00,201 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2024-11-10 23:19:00,201 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 50 transitions. [2024-11-10 23:19:00,202 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-10 23:19:00,203 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 50 transitions. [2024-11-10 23:19:00,203 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-10 23:19:00,204 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-10 23:19:00,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 50 transitions. [2024-11-10 23:19:00,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:19:00,205 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 50 transitions. [2024-11-10 23:19:00,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 50 transitions. [2024-11-10 23:19:00,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-10 23:19:00,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 28 states have internal predecessors, (28), 10 states have call successors, (10), 5 states have call predecessors, (10), 8 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-10 23:19:00,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2024-11-10 23:19:00,208 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 50 transitions. [2024-11-10 23:19:00,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 23:19:00,209 INFO L425 stractBuchiCegarLoop]: Abstraction has 42 states and 50 transitions. [2024-11-10 23:19:00,209 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-10 23:19:00,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 50 transitions. [2024-11-10 23:19:00,210 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-10 23:19:00,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:19:00,211 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:19:00,212 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-10 23:19:00,212 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:19:00,212 INFO L745 eck$LassoCheckResult]: Stem: 616#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); 617#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#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#3(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#2(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#5(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 585#L128-1 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 613#func_to_recursive_line_23_to_24_0ENTRY [2024-11-10 23:19:00,213 INFO L747 eck$LassoCheckResult]: Loop: 613#func_to_recursive_line_23_to_24_0ENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#1(~a.base, ~a.offset, 4); 597#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4); 584#L107-1 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 587#func_to_recursive_line_24_to_25_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 592#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4); 594#L87-1 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 612#func_to_recursive_line_25_to_26_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4); 620#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4); 605#L67-1 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 615#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 611#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 590#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 588#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 591#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 589#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 588#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 591#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 614#func_to_recursive_line_27_to_27_0FINAL assume true; 602#func_to_recursive_line_27_to_27_0EXIT >#65#return; 603#func_to_recursive_line_27_to_27_0FINAL assume true; 624#func_to_recursive_line_27_to_27_0EXIT >#69#return; 618#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 606#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 615#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 611#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 604#func_to_recursive_line_26_to_27_0FINAL assume true; 607#func_to_recursive_line_26_to_27_0EXIT >#67#return; 610#func_to_recursive_line_26_to_27_0FINAL assume true; 625#func_to_recursive_line_26_to_27_0EXIT >#63#return; 609#L67 call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 600#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 612#func_to_recursive_line_25_to_26_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4); 620#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 608#func_to_recursive_line_25_to_26_0FINAL assume true; 599#func_to_recursive_line_25_to_26_0EXIT >#61#return; 601#func_to_recursive_line_25_to_26_0FINAL assume true; 623#func_to_recursive_line_25_to_26_0EXIT >#59#return; 619#L87 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 593#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 587#func_to_recursive_line_24_to_25_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 592#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 595#func_to_recursive_line_24_to_25_0FINAL assume true; 598#func_to_recursive_line_24_to_25_0EXIT >#57#return; 621#func_to_recursive_line_24_to_25_0FINAL assume true; 622#func_to_recursive_line_24_to_25_0EXIT >#73#return; 596#L107 call #t~mem17 := read~int#1(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#1(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 586#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 613#func_to_recursive_line_23_to_24_0ENTRY [2024-11-10 23:19:00,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:19:00,213 INFO L85 PathProgramCache]: Analyzing trace with hash 83402, now seen corresponding path program 5 times [2024-11-10 23:19:00,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:19:00,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467272144] [2024-11-10 23:19:00,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:19:00,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:19:00,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:19:00,227 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:19:00,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:19:00,235 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:19:00,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:19:00,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1731545009, now seen corresponding path program 1 times [2024-11-10 23:19:00,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:19:00,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435717733] [2024-11-10 23:19:00,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:19:00,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:19:00,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:00,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:00,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:00,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:00,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:00,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:00,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:01,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:01,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:01,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:01,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 23:19:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:01,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 23:19:01,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:01,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 23:19:01,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:01,147 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 23:19:01,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:19:01,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435717733] [2024-11-10 23:19:01,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435717733] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 23:19:01,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153239497] [2024-11-10 23:19:01,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:19:01,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 23:19:01,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:19:01,152 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:19:01,153 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:19:01,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:01,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-10 23:19:01,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:19:01,387 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:01,667 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-10 23:19:01,667 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 23:19:02,316 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-10 23:19:02,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153239497] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 23:19:02,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 23:19:02,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 10] total 27 [2024-11-10 23:19:02,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778923687] [2024-11-10 23:19:02,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 23:19:02,318 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:19:02,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:19:02,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-10 23:19:02,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2024-11-10 23:19:02,319 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. cyclomatic complexity: 13 Second operand has 27 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 20 states have internal predecessors, (51), 11 states have call successors, (21), 9 states have call predecessors, (21), 8 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2024-11-10 23:19:02,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:19:02,965 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2024-11-10 23:19:02,966 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 54 transitions. [2024-11-10 23:19:02,968 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-10 23:19:02,971 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 54 transitions. [2024-11-10 23:19:02,972 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2024-11-10 23:19:02,972 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2024-11-10 23:19:02,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 54 transitions. [2024-11-10 23:19:02,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:19:02,974 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-11-10 23:19:02,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 54 transitions. [2024-11-10 23:19:02,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-10 23:19:02,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 30 states have internal predecessors, (30), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (14), 10 states have call predecessors, (14), 8 states have call successors, (14) [2024-11-10 23:19:02,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2024-11-10 23:19:02,980 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-11-10 23:19:02,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 23:19:02,986 INFO L425 stractBuchiCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-11-10 23:19:02,986 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-10 23:19:02,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 54 transitions. [2024-11-10 23:19:02,987 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-10 23:19:02,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:19:02,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:19:02,989 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-10 23:19:02,989 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:19:02,990 INFO L745 eck$LassoCheckResult]: Stem: 1150#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); 1151#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#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#3(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#2(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#5(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 1118#L128-1 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 1147#func_to_recursive_line_23_to_24_0ENTRY [2024-11-10 23:19:02,990 INFO L747 eck$LassoCheckResult]: Loop: 1147#func_to_recursive_line_23_to_24_0ENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#1(~a.base, ~a.offset, 4); 1130#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4); 1117#L107-1 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1120#func_to_recursive_line_24_to_25_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 1125#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4); 1127#L87-1 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1146#func_to_recursive_line_25_to_26_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4); 1154#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4); 1139#L67-1 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1149#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 1145#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 1123#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1121#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 1124#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1122#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1121#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 1124#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1148#func_to_recursive_line_27_to_27_0FINAL assume true; 1133#func_to_recursive_line_27_to_27_0EXIT >#65#return; 1134#func_to_recursive_line_27_to_27_0FINAL assume true; 1158#func_to_recursive_line_27_to_27_0EXIT >#69#return; 1152#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 1140#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1149#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 1145#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 1123#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1121#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 1124#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1122#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1121#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 1124#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1148#func_to_recursive_line_27_to_27_0FINAL assume true; 1133#func_to_recursive_line_27_to_27_0EXIT >#65#return; 1134#func_to_recursive_line_27_to_27_0FINAL assume true; 1158#func_to_recursive_line_27_to_27_0EXIT >#69#return; 1152#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 1140#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1149#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 1145#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1138#func_to_recursive_line_26_to_27_0FINAL assume true; 1141#func_to_recursive_line_26_to_27_0EXIT >#67#return; 1144#func_to_recursive_line_26_to_27_0FINAL assume true; 1162#func_to_recursive_line_26_to_27_0EXIT >#67#return; 1161#func_to_recursive_line_26_to_27_0FINAL assume true; 1160#func_to_recursive_line_26_to_27_0EXIT >#63#return; 1143#L67 call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 1136#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1146#func_to_recursive_line_25_to_26_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4); 1154#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4); 1139#L67-1 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1149#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 1145#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 1123#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1121#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 1124#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1122#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1121#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 1124#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1148#func_to_recursive_line_27_to_27_0FINAL assume true; 1133#func_to_recursive_line_27_to_27_0EXIT >#65#return; 1134#func_to_recursive_line_27_to_27_0FINAL assume true; 1158#func_to_recursive_line_27_to_27_0EXIT >#69#return; 1152#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 1140#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1149#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 1145#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 1123#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1121#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 1124#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1122#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1121#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 1124#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1148#func_to_recursive_line_27_to_27_0FINAL assume true; 1133#func_to_recursive_line_27_to_27_0EXIT >#65#return; 1134#func_to_recursive_line_27_to_27_0FINAL assume true; 1158#func_to_recursive_line_27_to_27_0EXIT >#69#return; 1152#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 1140#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1149#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 1145#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1138#func_to_recursive_line_26_to_27_0FINAL assume true; 1141#func_to_recursive_line_26_to_27_0EXIT >#67#return; 1144#func_to_recursive_line_26_to_27_0FINAL assume true; 1162#func_to_recursive_line_26_to_27_0EXIT >#67#return; 1161#func_to_recursive_line_26_to_27_0FINAL assume true; 1160#func_to_recursive_line_26_to_27_0EXIT >#63#return; 1143#L67 call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 1136#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1146#func_to_recursive_line_25_to_26_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4); 1154#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1142#func_to_recursive_line_25_to_26_0FINAL assume true; 1135#func_to_recursive_line_25_to_26_0EXIT >#61#return; 1137#func_to_recursive_line_25_to_26_0FINAL assume true; 1159#func_to_recursive_line_25_to_26_0EXIT >#61#return; 1157#func_to_recursive_line_25_to_26_0FINAL assume true; 1156#func_to_recursive_line_25_to_26_0EXIT >#59#return; 1153#L87 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 1126#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1120#func_to_recursive_line_24_to_25_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 1125#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1128#func_to_recursive_line_24_to_25_0FINAL assume true; 1155#func_to_recursive_line_24_to_25_0EXIT >#57#return; 1131#func_to_recursive_line_24_to_25_0FINAL assume true; 1132#func_to_recursive_line_24_to_25_0EXIT >#73#return; 1129#L107 call #t~mem17 := read~int#1(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#1(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 1119#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 1147#func_to_recursive_line_23_to_24_0ENTRY [2024-11-10 23:19:02,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:19:02,995 INFO L85 PathProgramCache]: Analyzing trace with hash 83402, now seen corresponding path program 6 times [2024-11-10 23:19:02,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:19:02,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909741315] [2024-11-10 23:19:02,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:19:02,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:19:03,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:19:03,009 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:19:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:19:03,022 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:19:03,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:19:03,024 INFO L85 PathProgramCache]: Analyzing trace with hash -2023486089, now seen corresponding path program 2 times [2024-11-10 23:19:03,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:19:03,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557226655] [2024-11-10 23:19:03,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:19:03,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:19:03,065 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,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:04,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:04,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:04,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:04,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:04,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:04,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:04,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 23:19:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:04,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:04,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:04,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:04,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 23:19:04,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:04,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 23:19:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:05,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:05,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:05,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:05,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:05,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:05,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:05,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 23:19:05,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:05,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:05,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:05,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:05,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:05,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 23:19:05,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:05,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 23:19:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:05,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 23:19:05,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:05,055 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 25 proven. 64 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-10 23:19:05,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:19:05,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557226655] [2024-11-10 23:19:05,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557226655] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 23:19:05,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199165911] [2024-11-10 23:19:05,056 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 23:19:05,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 23:19:05,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:19:05,058 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:19:05,060 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:19:05,259 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 23:19:05,259 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 23:19:05,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-10 23:19:05,272 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:19:05,304 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:05,534 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 100 proven. 3 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-10 23:19:05,534 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 23:19:06,750 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 84 proven. 4 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-10 23:19:06,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199165911] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 23:19:06,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 23:19:06,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 10] total 30 [2024-11-10 23:19:06,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201618281] [2024-11-10 23:19:06,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 23:19:06,753 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:19:06,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:19:06,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-10 23:19:06,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2024-11-10 23:19:06,756 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. cyclomatic complexity: 13 Second operand has 30 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 24 states have internal predecessors, (63), 11 states have call successors, (33), 8 states have call predecessors, (33), 8 states have return successors, (25), 7 states have call predecessors, (25), 11 states have call successors, (25) [2024-11-10 23:19:07,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:19:07,330 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2024-11-10 23:19:07,331 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 58 transitions. [2024-11-10 23:19:07,332 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-10 23:19:07,334 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 58 transitions. [2024-11-10 23:19:07,335 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2024-11-10 23:19:07,335 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2024-11-10 23:19:07,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 58 transitions. [2024-11-10 23:19:07,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:19:07,336 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 58 transitions. [2024-11-10 23:19:07,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 58 transitions. [2024-11-10 23:19:07,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-10 23:19:07,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 32 states have internal predecessors, (32), 10 states have call successors, (10), 5 states have call predecessors, (10), 12 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-10 23:19:07,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2024-11-10 23:19:07,341 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 58 transitions. [2024-11-10 23:19:07,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 23:19:07,342 INFO L425 stractBuchiCegarLoop]: Abstraction has 50 states and 58 transitions. [2024-11-10 23:19:07,342 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-10 23:19:07,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 58 transitions. [2024-11-10 23:19:07,343 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-10 23:19:07,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:19:07,343 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:19:07,346 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-10 23:19:07,346 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [16, 16, 12, 12, 12, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:19:07,346 INFO L745 eck$LassoCheckResult]: Stem: 2344#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); 2345#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#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#3(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#2(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#5(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 2313#L128-1 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 2341#func_to_recursive_line_23_to_24_0ENTRY [2024-11-10 23:19:07,347 INFO L747 eck$LassoCheckResult]: Loop: 2341#func_to_recursive_line_23_to_24_0ENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#1(~a.base, ~a.offset, 4); 2325#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4); 2312#L107-1 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2315#func_to_recursive_line_24_to_25_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 2320#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4); 2322#L87-1 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2340#func_to_recursive_line_25_to_26_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4); 2348#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4); 2333#L67-1 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 2343#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 2339#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 2318#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2316#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2319#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2317#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2316#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2319#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2317#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2316#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2319#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2317#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2316#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2319#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2342#func_to_recursive_line_27_to_27_0FINAL assume true; 2330#func_to_recursive_line_27_to_27_0EXIT >#65#return; 2331#func_to_recursive_line_27_to_27_0FINAL assume true; 2361#func_to_recursive_line_27_to_27_0EXIT >#65#return; 2360#func_to_recursive_line_27_to_27_0FINAL assume true; 2358#func_to_recursive_line_27_to_27_0EXIT >#65#return; 2355#func_to_recursive_line_27_to_27_0FINAL assume true; 2354#func_to_recursive_line_27_to_27_0EXIT >#69#return; 2346#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 2334#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 2343#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 2339#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 2318#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2316#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2319#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2317#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2316#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2319#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2317#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2316#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2319#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2317#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2316#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2319#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2342#func_to_recursive_line_27_to_27_0FINAL assume true; 2330#func_to_recursive_line_27_to_27_0EXIT >#65#return; 2331#func_to_recursive_line_27_to_27_0FINAL assume true; 2361#func_to_recursive_line_27_to_27_0EXIT >#65#return; 2360#func_to_recursive_line_27_to_27_0FINAL assume true; 2358#func_to_recursive_line_27_to_27_0EXIT >#65#return; 2355#func_to_recursive_line_27_to_27_0FINAL assume true; 2354#func_to_recursive_line_27_to_27_0EXIT >#69#return; 2346#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 2334#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 2343#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 2339#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2332#func_to_recursive_line_26_to_27_0FINAL assume true; 2335#func_to_recursive_line_26_to_27_0EXIT >#67#return; 2338#func_to_recursive_line_26_to_27_0FINAL assume true; 2359#func_to_recursive_line_26_to_27_0EXIT >#67#return; 2357#func_to_recursive_line_26_to_27_0FINAL assume true; 2356#func_to_recursive_line_26_to_27_0EXIT >#63#return; 2337#L67 call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 2328#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2340#func_to_recursive_line_25_to_26_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4); 2348#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4); 2333#L67-1 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 2343#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 2339#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 2318#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2316#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2319#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2317#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2316#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2319#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2317#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2316#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2319#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2317#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2316#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2319#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2342#func_to_recursive_line_27_to_27_0FINAL assume true; 2330#func_to_recursive_line_27_to_27_0EXIT >#65#return; 2331#func_to_recursive_line_27_to_27_0FINAL assume true; 2361#func_to_recursive_line_27_to_27_0EXIT >#65#return; 2360#func_to_recursive_line_27_to_27_0FINAL assume true; 2358#func_to_recursive_line_27_to_27_0EXIT >#65#return; 2355#func_to_recursive_line_27_to_27_0FINAL assume true; 2354#func_to_recursive_line_27_to_27_0EXIT >#69#return; 2346#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 2334#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 2343#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 2339#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 2318#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2316#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2319#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2317#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2316#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2319#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2317#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2316#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2319#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2317#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2316#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2319#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2342#func_to_recursive_line_27_to_27_0FINAL assume true; 2330#func_to_recursive_line_27_to_27_0EXIT >#65#return; 2331#func_to_recursive_line_27_to_27_0FINAL assume true; 2361#func_to_recursive_line_27_to_27_0EXIT >#65#return; 2360#func_to_recursive_line_27_to_27_0FINAL assume true; 2358#func_to_recursive_line_27_to_27_0EXIT >#65#return; 2355#func_to_recursive_line_27_to_27_0FINAL assume true; 2354#func_to_recursive_line_27_to_27_0EXIT >#69#return; 2346#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 2334#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 2343#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 2339#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2332#func_to_recursive_line_26_to_27_0FINAL assume true; 2335#func_to_recursive_line_26_to_27_0EXIT >#67#return; 2338#func_to_recursive_line_26_to_27_0FINAL assume true; 2359#func_to_recursive_line_26_to_27_0EXIT >#67#return; 2357#func_to_recursive_line_26_to_27_0FINAL assume true; 2356#func_to_recursive_line_26_to_27_0EXIT >#63#return; 2337#L67 call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 2328#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2340#func_to_recursive_line_25_to_26_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4); 2348#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 2336#func_to_recursive_line_25_to_26_0FINAL assume true; 2327#func_to_recursive_line_25_to_26_0EXIT >#61#return; 2329#func_to_recursive_line_25_to_26_0FINAL assume true; 2353#func_to_recursive_line_25_to_26_0EXIT >#61#return; 2352#func_to_recursive_line_25_to_26_0FINAL assume true; 2351#func_to_recursive_line_25_to_26_0EXIT >#59#return; 2347#L87 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 2321#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2315#func_to_recursive_line_24_to_25_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 2320#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 2323#func_to_recursive_line_24_to_25_0FINAL assume true; 2326#func_to_recursive_line_24_to_25_0EXIT >#57#return; 2349#func_to_recursive_line_24_to_25_0FINAL assume true; 2350#func_to_recursive_line_24_to_25_0EXIT >#73#return; 2324#L107 call #t~mem17 := read~int#1(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#1(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 2314#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 2341#func_to_recursive_line_23_to_24_0ENTRY [2024-11-10 23:19:07,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:19:07,347 INFO L85 PathProgramCache]: Analyzing trace with hash 83402, now seen corresponding path program 7 times [2024-11-10 23:19:07,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:19:07,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893611027] [2024-11-10 23:19:07,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:19:07,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:19:07,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:19:07,362 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:19:07,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:19:07,373 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:19:07,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:19:07,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1384062839, now seen corresponding path program 3 times [2024-11-10 23:19:07,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:19:07,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157320399] [2024-11-10 23:19:07,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:19:07,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:19:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:08,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:09,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:09,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:09,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:09,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:10,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:10,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:10,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:10,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:10,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:10,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:10,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:10,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 23:19:10,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:10,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:10,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:10,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:10,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:10,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:10,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:10,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:10,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:10,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 23:19:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:10,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 23:19:10,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:10,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:10,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:10,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:10,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:10,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:10,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 23:19:10,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:10,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:10,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:10,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:10,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:10,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:10,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:10,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:10,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 23:19:10,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:10,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 23:19:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:10,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 23:19:10,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:10,656 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 14 proven. 203 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2024-11-10 23:19:10,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:19:10,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157320399] [2024-11-10 23:19:10,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157320399] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 23:19:10,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100375156] [2024-11-10 23:19:10,657 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 23:19:10,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 23:19:10,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:19:10,659 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:19:10,661 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:19:10,813 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-10 23:19:10,813 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 23:19:10,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-10 23:19:10,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:19:10,827 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:11,003 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2024-11-10 23:19:11,004 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 23:19:11,619 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2024-11-10 23:19:11,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100375156] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 23:19:11,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 23:19:11,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 10] total 31 [2024-11-10 23:19:11,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947747113] [2024-11-10 23:19:11,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 23:19:11,621 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:19:11,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:19:11,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-10 23:19:11,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=814, Unknown=0, NotChecked=0, Total=930 [2024-11-10 23:19:11,622 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. cyclomatic complexity: 13 Second operand has 31 states, 24 states have (on average 2.375) internal successors, (57), 24 states have internal predecessors, (57), 11 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (21), 9 states have call predecessors, (21), 11 states have call successors, (21) [2024-11-10 23:19:12,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:19:12,219 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2024-11-10 23:19:12,219 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 62 transitions. [2024-11-10 23:19:12,220 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-10 23:19:12,221 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 62 transitions. [2024-11-10 23:19:12,221 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2024-11-10 23:19:12,221 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2024-11-10 23:19:12,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 62 transitions. [2024-11-10 23:19:12,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:19:12,222 INFO L218 hiAutomatonCegarLoop]: Abstraction has 54 states and 62 transitions. [2024-11-10 23:19:12,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 62 transitions. [2024-11-10 23:19:12,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-10 23:19:12,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 34 states have internal predecessors, (34), 10 states have call successors, (10), 5 states have call predecessors, (10), 14 states have return successors, (18), 14 states have call predecessors, (18), 8 states have call successors, (18) [2024-11-10 23:19:12,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2024-11-10 23:19:12,227 INFO L240 hiAutomatonCegarLoop]: Abstraction has 54 states and 62 transitions. [2024-11-10 23:19:12,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 23:19:12,228 INFO L425 stractBuchiCegarLoop]: Abstraction has 54 states and 62 transitions. [2024-11-10 23:19:12,228 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-10 23:19:12,228 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 62 transitions. [2024-11-10 23:19:12,228 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-10 23:19:12,229 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:19:12,229 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:19:12,234 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-10 23:19:12,234 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [40, 40, 32, 32, 32, 12, 12, 8, 8, 8, 8, 8, 8, 8, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:19:12,235 INFO L745 eck$LassoCheckResult]: Stem: 4089#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); 4090#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#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#3(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#2(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#5(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 4059#L128-1 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 4086#func_to_recursive_line_23_to_24_0ENTRY [2024-11-10 23:19:12,238 INFO L747 eck$LassoCheckResult]: Loop: 4086#func_to_recursive_line_23_to_24_0ENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#1(~a.base, ~a.offset, 4); 4069#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4); 4057#L107-1 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 4060#func_to_recursive_line_24_to_25_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 4065#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4); 4067#L87-1 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 4085#func_to_recursive_line_25_to_26_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4); 4093#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4); 4078#L67-1 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 4088#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 4084#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 4063#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4061#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4064#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4061#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4064#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4061#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4064#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4061#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4064#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4061#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4064#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4087#func_to_recursive_line_27_to_27_0FINAL assume true; 4075#func_to_recursive_line_27_to_27_0EXIT >#65#return; 4076#func_to_recursive_line_27_to_27_0FINAL assume true; 4110#func_to_recursive_line_27_to_27_0EXIT >#65#return; 4109#func_to_recursive_line_27_to_27_0FINAL assume true; 4108#func_to_recursive_line_27_to_27_0EXIT >#65#return; 4107#func_to_recursive_line_27_to_27_0FINAL assume true; 4106#func_to_recursive_line_27_to_27_0EXIT >#65#return; 4105#func_to_recursive_line_27_to_27_0FINAL assume true; 4104#func_to_recursive_line_27_to_27_0EXIT >#69#return; 4091#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 4079#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 4088#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 4084#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 4063#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4061#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4064#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4061#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4064#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4061#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4064#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4061#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4064#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4061#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4064#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4087#func_to_recursive_line_27_to_27_0FINAL assume true; 4075#func_to_recursive_line_27_to_27_0EXIT >#65#return; 4076#func_to_recursive_line_27_to_27_0FINAL assume true; 4110#func_to_recursive_line_27_to_27_0EXIT >#65#return; 4109#func_to_recursive_line_27_to_27_0FINAL assume true; 4108#func_to_recursive_line_27_to_27_0EXIT >#65#return; 4107#func_to_recursive_line_27_to_27_0FINAL assume true; 4106#func_to_recursive_line_27_to_27_0EXIT >#65#return; 4105#func_to_recursive_line_27_to_27_0FINAL assume true; 4104#func_to_recursive_line_27_to_27_0EXIT >#69#return; 4091#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 4079#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 4088#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 4084#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 4077#func_to_recursive_line_26_to_27_0FINAL assume true; 4080#func_to_recursive_line_26_to_27_0EXIT >#67#return; 4083#func_to_recursive_line_26_to_27_0FINAL assume true; 4103#func_to_recursive_line_26_to_27_0EXIT >#67#return; 4101#func_to_recursive_line_26_to_27_0FINAL assume true; 4100#func_to_recursive_line_26_to_27_0EXIT >#63#return; 4082#L67 call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 4073#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 4085#func_to_recursive_line_25_to_26_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4); 4093#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4); 4078#L67-1 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 4088#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 4084#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 4063#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4061#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4064#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4061#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4064#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4061#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4064#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4061#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4064#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4061#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4064#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4087#func_to_recursive_line_27_to_27_0FINAL assume true; 4075#func_to_recursive_line_27_to_27_0EXIT >#65#return; 4076#func_to_recursive_line_27_to_27_0FINAL assume true; 4110#func_to_recursive_line_27_to_27_0EXIT >#65#return; 4109#func_to_recursive_line_27_to_27_0FINAL assume true; 4108#func_to_recursive_line_27_to_27_0EXIT >#65#return; 4107#func_to_recursive_line_27_to_27_0FINAL assume true; 4106#func_to_recursive_line_27_to_27_0EXIT >#65#return; 4105#func_to_recursive_line_27_to_27_0FINAL assume true; 4104#func_to_recursive_line_27_to_27_0EXIT >#69#return; 4091#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 4079#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 4088#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 4084#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 4063#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4061#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4064#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4061#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4064#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4061#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4064#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4061#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4064#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4061#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4064#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4087#func_to_recursive_line_27_to_27_0FINAL assume true; 4075#func_to_recursive_line_27_to_27_0EXIT >#65#return; 4076#func_to_recursive_line_27_to_27_0FINAL assume true; 4110#func_to_recursive_line_27_to_27_0EXIT >#65#return; 4109#func_to_recursive_line_27_to_27_0FINAL assume true; 4108#func_to_recursive_line_27_to_27_0EXIT >#65#return; 4107#func_to_recursive_line_27_to_27_0FINAL assume true; 4106#func_to_recursive_line_27_to_27_0EXIT >#65#return; 4105#func_to_recursive_line_27_to_27_0FINAL assume true; 4104#func_to_recursive_line_27_to_27_0EXIT >#69#return; 4091#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 4079#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 4088#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 4084#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 4077#func_to_recursive_line_26_to_27_0FINAL assume true; 4080#func_to_recursive_line_26_to_27_0EXIT >#67#return; 4083#func_to_recursive_line_26_to_27_0FINAL assume true; 4103#func_to_recursive_line_26_to_27_0EXIT >#67#return; 4101#func_to_recursive_line_26_to_27_0FINAL assume true; 4100#func_to_recursive_line_26_to_27_0EXIT >#63#return; 4082#L67 call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 4073#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 4085#func_to_recursive_line_25_to_26_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4); 4093#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 4081#func_to_recursive_line_25_to_26_0FINAL assume true; 4072#func_to_recursive_line_25_to_26_0EXIT >#61#return; 4074#func_to_recursive_line_25_to_26_0FINAL assume true; 4097#func_to_recursive_line_25_to_26_0EXIT >#61#return; 4096#func_to_recursive_line_25_to_26_0FINAL assume true; 4095#func_to_recursive_line_25_to_26_0EXIT >#59#return; 4092#L87 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 4066#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 4060#func_to_recursive_line_24_to_25_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 4065#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4); 4067#L87-1 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 4085#func_to_recursive_line_25_to_26_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4); 4093#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4); 4078#L67-1 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 4088#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 4084#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 4063#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4061#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4064#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4061#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4064#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4061#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4064#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4061#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4064#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4061#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4064#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4087#func_to_recursive_line_27_to_27_0FINAL assume true; 4075#func_to_recursive_line_27_to_27_0EXIT >#65#return; 4076#func_to_recursive_line_27_to_27_0FINAL assume true; 4110#func_to_recursive_line_27_to_27_0EXIT >#65#return; 4109#func_to_recursive_line_27_to_27_0FINAL assume true; 4108#func_to_recursive_line_27_to_27_0EXIT >#65#return; 4107#func_to_recursive_line_27_to_27_0FINAL assume true; 4106#func_to_recursive_line_27_to_27_0EXIT >#65#return; 4105#func_to_recursive_line_27_to_27_0FINAL assume true; 4104#func_to_recursive_line_27_to_27_0EXIT >#69#return; 4091#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 4079#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 4088#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 4084#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 4063#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4061#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4064#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4061#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4064#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4061#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4064#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4061#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4064#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4061#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4064#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4087#func_to_recursive_line_27_to_27_0FINAL assume true; 4075#func_to_recursive_line_27_to_27_0EXIT >#65#return; 4076#func_to_recursive_line_27_to_27_0FINAL assume true; 4110#func_to_recursive_line_27_to_27_0EXIT >#65#return; 4109#func_to_recursive_line_27_to_27_0FINAL assume true; 4108#func_to_recursive_line_27_to_27_0EXIT >#65#return; 4107#func_to_recursive_line_27_to_27_0FINAL assume true; 4106#func_to_recursive_line_27_to_27_0EXIT >#65#return; 4105#func_to_recursive_line_27_to_27_0FINAL assume true; 4104#func_to_recursive_line_27_to_27_0EXIT >#69#return; 4091#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 4079#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 4088#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 4084#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 4077#func_to_recursive_line_26_to_27_0FINAL assume true; 4080#func_to_recursive_line_26_to_27_0EXIT >#67#return; 4083#func_to_recursive_line_26_to_27_0FINAL assume true; 4103#func_to_recursive_line_26_to_27_0EXIT >#67#return; 4101#func_to_recursive_line_26_to_27_0FINAL assume true; 4100#func_to_recursive_line_26_to_27_0EXIT >#63#return; 4082#L67 call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 4073#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 4085#func_to_recursive_line_25_to_26_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4); 4093#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4); 4078#L67-1 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 4088#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 4084#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 4063#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4061#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4064#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4061#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4064#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4061#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4064#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4061#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4064#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4061#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4064#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4087#func_to_recursive_line_27_to_27_0FINAL assume true; 4075#func_to_recursive_line_27_to_27_0EXIT >#65#return; 4076#func_to_recursive_line_27_to_27_0FINAL assume true; 4110#func_to_recursive_line_27_to_27_0EXIT >#65#return; 4109#func_to_recursive_line_27_to_27_0FINAL assume true; 4108#func_to_recursive_line_27_to_27_0EXIT >#65#return; 4107#func_to_recursive_line_27_to_27_0FINAL assume true; 4106#func_to_recursive_line_27_to_27_0EXIT >#65#return; 4105#func_to_recursive_line_27_to_27_0FINAL assume true; 4104#func_to_recursive_line_27_to_27_0EXIT >#69#return; 4091#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 4079#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 4088#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 4084#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 4063#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4061#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4064#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4061#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4064#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4061#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4064#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4061#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4064#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 4062#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 4061#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 4064#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4087#func_to_recursive_line_27_to_27_0FINAL assume true; 4075#func_to_recursive_line_27_to_27_0EXIT >#65#return; 4076#func_to_recursive_line_27_to_27_0FINAL assume true; 4110#func_to_recursive_line_27_to_27_0EXIT >#65#return; 4109#func_to_recursive_line_27_to_27_0FINAL assume true; 4108#func_to_recursive_line_27_to_27_0EXIT >#65#return; 4107#func_to_recursive_line_27_to_27_0FINAL assume true; 4106#func_to_recursive_line_27_to_27_0EXIT >#65#return; 4105#func_to_recursive_line_27_to_27_0FINAL assume true; 4104#func_to_recursive_line_27_to_27_0EXIT >#69#return; 4091#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 4079#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 4088#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 4084#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 4077#func_to_recursive_line_26_to_27_0FINAL assume true; 4080#func_to_recursive_line_26_to_27_0EXIT >#67#return; 4083#func_to_recursive_line_26_to_27_0FINAL assume true; 4103#func_to_recursive_line_26_to_27_0EXIT >#67#return; 4101#func_to_recursive_line_26_to_27_0FINAL assume true; 4100#func_to_recursive_line_26_to_27_0EXIT >#63#return; 4082#L67 call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 4073#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 4085#func_to_recursive_line_25_to_26_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4); 4093#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 4081#func_to_recursive_line_25_to_26_0FINAL assume true; 4072#func_to_recursive_line_25_to_26_0EXIT >#61#return; 4074#func_to_recursive_line_25_to_26_0FINAL assume true; 4097#func_to_recursive_line_25_to_26_0EXIT >#61#return; 4096#func_to_recursive_line_25_to_26_0FINAL assume true; 4095#func_to_recursive_line_25_to_26_0EXIT >#59#return; 4092#L87 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 4066#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 4060#func_to_recursive_line_24_to_25_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 4065#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 4068#func_to_recursive_line_24_to_25_0FINAL assume true; 4071#func_to_recursive_line_24_to_25_0EXIT >#57#return; 4094#func_to_recursive_line_24_to_25_0FINAL assume true; 4102#func_to_recursive_line_24_to_25_0EXIT >#57#return; 4099#func_to_recursive_line_24_to_25_0FINAL assume true; 4098#func_to_recursive_line_24_to_25_0EXIT >#73#return; 4070#L107 call #t~mem17 := read~int#1(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#1(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 4058#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 4086#func_to_recursive_line_23_to_24_0ENTRY [2024-11-10 23:19:12,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:19:12,242 INFO L85 PathProgramCache]: Analyzing trace with hash 83402, now seen corresponding path program 8 times [2024-11-10 23:19:12,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:19:12,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882282808] [2024-11-10 23:19:12,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:19:12,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:19:12,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:19:12,256 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:19:12,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:19:12,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:19:12,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:19:12,266 INFO L85 PathProgramCache]: Analyzing trace with hash -235822052, now seen corresponding path program 4 times [2024-11-10 23:19:12,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:19:12,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605752737] [2024-11-10 23:19:12,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:19:12,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:19:12,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:13,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:14,056 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,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:16,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:16,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:16,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:16,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:16,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:16,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:16,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:16,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:16,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:16,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:16,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 23:19:16,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:16,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:16,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:17,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:17,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:17,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 23:19:17,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-10 23:19:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:17,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:17,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:17,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:17,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:17,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 23:19:17,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:17,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:17,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 23:19:17,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-10 23:19:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 23:19:17,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:17,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:17,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:17,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 23:19:17,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:17,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:17,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:17,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 23:19:17,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-10 23:19:17,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:17,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:17,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 23:19:17,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:17,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:17,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:17,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:17,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:17,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 23:19:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-10 23:19:17,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 23:19:17,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:17,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4057 backedges. 111 proven. 673 refuted. 0 times theorem prover too weak. 3273 trivial. 0 not checked. [2024-11-10 23:19:17,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:19:17,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605752737] [2024-11-10 23:19:17,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605752737] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 23:19:17,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081143802] [2024-11-10 23:19:17,785 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-10 23:19:17,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 23:19:17,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:19:17,787 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:17,789 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:18,200 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-10 23:19:18,200 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 23:19:18,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 2044 conjuncts, 99 conjuncts are in the unsatisfiable core [2024-11-10 23:19:18,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:19:18,300 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:18,677 INFO L134 CoverageAnalysis]: Checked inductivity of 4057 backedges. 2189 proven. 40 refuted. 0 times theorem prover too weak. 1828 trivial. 0 not checked. [2024-11-10 23:19:18,677 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 23:19:22,370 INFO L134 CoverageAnalysis]: Checked inductivity of 4057 backedges. 258 proven. 671 refuted. 0 times theorem prover too weak. 3128 trivial. 0 not checked. [2024-11-10 23:19:22,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081143802] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 23:19:22,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 23:19:22,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 15, 22] total 49 [2024-11-10 23:19:22,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469217040] [2024-11-10 23:19:22,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 23:19:22,374 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:19:22,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:19:22,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-10 23:19:22,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=2014, Unknown=0, NotChecked=0, Total=2352 [2024-11-10 23:19:22,376 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. cyclomatic complexity: 13 Second operand has 49 states, 37 states have (on average 2.4594594594594597) internal successors, (91), 40 states have internal predecessors, (91), 18 states have call successors, (47), 11 states have call predecessors, (47), 14 states have return successors, (44), 14 states have call predecessors, (44), 18 states have call successors, (44) [2024-11-10 23:19:23,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:19:23,080 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2024-11-10 23:19:23,080 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 66 transitions. [2024-11-10 23:19:23,081 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-10 23:19:23,082 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 66 transitions. [2024-11-10 23:19:23,082 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2024-11-10 23:19:23,082 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2024-11-10 23:19:23,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 66 transitions. [2024-11-10 23:19:23,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:19:23,083 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 66 transitions. [2024-11-10 23:19:23,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 66 transitions. [2024-11-10 23:19:23,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-10 23:19:23,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 32 states have (on average 1.125) internal successors, (36), 36 states have internal predecessors, (36), 10 states have call successors, (10), 5 states have call predecessors, (10), 16 states have return successors, (20), 16 states have call predecessors, (20), 8 states have call successors, (20) [2024-11-10 23:19:23,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2024-11-10 23:19:23,090 INFO L240 hiAutomatonCegarLoop]: Abstraction has 58 states and 66 transitions. [2024-11-10 23:19:23,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-10 23:19:23,091 INFO L425 stractBuchiCegarLoop]: Abstraction has 58 states and 66 transitions. [2024-11-10 23:19:23,091 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-10 23:19:23,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 66 transitions. [2024-11-10 23:19:23,092 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-10 23:19:23,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:19:23,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:19:23,096 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-10 23:19:23,096 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [56, 56, 48, 48, 48, 12, 12, 8, 8, 8, 8, 8, 8, 8, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:19:23,097 INFO L745 eck$LassoCheckResult]: Stem: 8136#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); 8137#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#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#3(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#2(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#5(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 8105#L128-1 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 8133#func_to_recursive_line_23_to_24_0ENTRY [2024-11-10 23:19:23,098 INFO L747 eck$LassoCheckResult]: Loop: 8133#func_to_recursive_line_23_to_24_0ENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#1(~a.base, ~a.offset, 4); 8117#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4); 8104#L107-1 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 8107#func_to_recursive_line_24_to_25_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 8112#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4); 8114#L87-1 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 8132#func_to_recursive_line_25_to_26_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4); 8140#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4); 8125#L67-1 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 8135#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 8131#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 8110#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8134#func_to_recursive_line_27_to_27_0FINAL assume true; 8119#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8120#func_to_recursive_line_27_to_27_0FINAL assume true; 8158#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8157#func_to_recursive_line_27_to_27_0FINAL assume true; 8156#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8155#func_to_recursive_line_27_to_27_0FINAL assume true; 8154#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8153#func_to_recursive_line_27_to_27_0FINAL assume true; 8152#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8151#func_to_recursive_line_27_to_27_0FINAL assume true; 8150#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8149#func_to_recursive_line_27_to_27_0FINAL assume true; 8148#func_to_recursive_line_27_to_27_0EXIT >#69#return; 8138#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 8126#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 8135#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 8131#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 8110#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8134#func_to_recursive_line_27_to_27_0FINAL assume true; 8119#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8120#func_to_recursive_line_27_to_27_0FINAL assume true; 8158#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8157#func_to_recursive_line_27_to_27_0FINAL assume true; 8156#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8155#func_to_recursive_line_27_to_27_0FINAL assume true; 8154#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8153#func_to_recursive_line_27_to_27_0FINAL assume true; 8152#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8151#func_to_recursive_line_27_to_27_0FINAL assume true; 8150#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8149#func_to_recursive_line_27_to_27_0FINAL assume true; 8148#func_to_recursive_line_27_to_27_0EXIT >#69#return; 8138#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 8126#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 8135#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 8131#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8124#func_to_recursive_line_26_to_27_0FINAL assume true; 8127#func_to_recursive_line_26_to_27_0EXIT >#67#return; 8130#func_to_recursive_line_26_to_27_0FINAL assume true; 8161#func_to_recursive_line_26_to_27_0EXIT >#67#return; 8160#func_to_recursive_line_26_to_27_0FINAL assume true; 8159#func_to_recursive_line_26_to_27_0EXIT >#63#return; 8129#L67 call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 8122#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 8132#func_to_recursive_line_25_to_26_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4); 8140#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4); 8125#L67-1 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 8135#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 8131#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 8110#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8134#func_to_recursive_line_27_to_27_0FINAL assume true; 8119#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8120#func_to_recursive_line_27_to_27_0FINAL assume true; 8158#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8157#func_to_recursive_line_27_to_27_0FINAL assume true; 8156#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8155#func_to_recursive_line_27_to_27_0FINAL assume true; 8154#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8153#func_to_recursive_line_27_to_27_0FINAL assume true; 8152#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8151#func_to_recursive_line_27_to_27_0FINAL assume true; 8150#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8149#func_to_recursive_line_27_to_27_0FINAL assume true; 8148#func_to_recursive_line_27_to_27_0EXIT >#69#return; 8138#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 8126#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 8135#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 8131#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 8110#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8134#func_to_recursive_line_27_to_27_0FINAL assume true; 8119#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8120#func_to_recursive_line_27_to_27_0FINAL assume true; 8158#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8157#func_to_recursive_line_27_to_27_0FINAL assume true; 8156#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8155#func_to_recursive_line_27_to_27_0FINAL assume true; 8154#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8153#func_to_recursive_line_27_to_27_0FINAL assume true; 8152#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8151#func_to_recursive_line_27_to_27_0FINAL assume true; 8150#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8149#func_to_recursive_line_27_to_27_0FINAL assume true; 8148#func_to_recursive_line_27_to_27_0EXIT >#69#return; 8138#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 8126#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 8135#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 8131#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8124#func_to_recursive_line_26_to_27_0FINAL assume true; 8127#func_to_recursive_line_26_to_27_0EXIT >#67#return; 8130#func_to_recursive_line_26_to_27_0FINAL assume true; 8161#func_to_recursive_line_26_to_27_0EXIT >#67#return; 8160#func_to_recursive_line_26_to_27_0FINAL assume true; 8159#func_to_recursive_line_26_to_27_0EXIT >#63#return; 8129#L67 call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 8122#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 8132#func_to_recursive_line_25_to_26_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4); 8140#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 8128#func_to_recursive_line_25_to_26_0FINAL assume true; 8121#func_to_recursive_line_25_to_26_0EXIT >#61#return; 8123#func_to_recursive_line_25_to_26_0FINAL assume true; 8147#func_to_recursive_line_25_to_26_0EXIT >#61#return; 8145#func_to_recursive_line_25_to_26_0FINAL assume true; 8144#func_to_recursive_line_25_to_26_0EXIT >#59#return; 8139#L87 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 8113#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 8107#func_to_recursive_line_24_to_25_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 8112#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4); 8114#L87-1 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 8132#func_to_recursive_line_25_to_26_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4); 8140#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4); 8125#L67-1 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 8135#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 8131#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 8110#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8134#func_to_recursive_line_27_to_27_0FINAL assume true; 8119#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8120#func_to_recursive_line_27_to_27_0FINAL assume true; 8158#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8157#func_to_recursive_line_27_to_27_0FINAL assume true; 8156#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8155#func_to_recursive_line_27_to_27_0FINAL assume true; 8154#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8153#func_to_recursive_line_27_to_27_0FINAL assume true; 8152#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8151#func_to_recursive_line_27_to_27_0FINAL assume true; 8150#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8149#func_to_recursive_line_27_to_27_0FINAL assume true; 8148#func_to_recursive_line_27_to_27_0EXIT >#69#return; 8138#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 8126#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 8135#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 8131#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 8110#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8134#func_to_recursive_line_27_to_27_0FINAL assume true; 8119#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8120#func_to_recursive_line_27_to_27_0FINAL assume true; 8158#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8157#func_to_recursive_line_27_to_27_0FINAL assume true; 8156#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8155#func_to_recursive_line_27_to_27_0FINAL assume true; 8154#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8153#func_to_recursive_line_27_to_27_0FINAL assume true; 8152#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8151#func_to_recursive_line_27_to_27_0FINAL assume true; 8150#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8149#func_to_recursive_line_27_to_27_0FINAL assume true; 8148#func_to_recursive_line_27_to_27_0EXIT >#69#return; 8138#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 8126#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 8135#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 8131#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8124#func_to_recursive_line_26_to_27_0FINAL assume true; 8127#func_to_recursive_line_26_to_27_0EXIT >#67#return; 8130#func_to_recursive_line_26_to_27_0FINAL assume true; 8161#func_to_recursive_line_26_to_27_0EXIT >#67#return; 8160#func_to_recursive_line_26_to_27_0FINAL assume true; 8159#func_to_recursive_line_26_to_27_0EXIT >#63#return; 8129#L67 call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 8122#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 8132#func_to_recursive_line_25_to_26_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4); 8140#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4); 8125#L67-1 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 8135#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 8131#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 8110#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8134#func_to_recursive_line_27_to_27_0FINAL assume true; 8119#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8120#func_to_recursive_line_27_to_27_0FINAL assume true; 8158#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8157#func_to_recursive_line_27_to_27_0FINAL assume true; 8156#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8155#func_to_recursive_line_27_to_27_0FINAL assume true; 8154#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8153#func_to_recursive_line_27_to_27_0FINAL assume true; 8152#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8151#func_to_recursive_line_27_to_27_0FINAL assume true; 8150#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8149#func_to_recursive_line_27_to_27_0FINAL assume true; 8148#func_to_recursive_line_27_to_27_0EXIT >#69#return; 8138#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 8126#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 8135#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 8131#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 8110#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8109#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8108#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8111#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8134#func_to_recursive_line_27_to_27_0FINAL assume true; 8119#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8120#func_to_recursive_line_27_to_27_0FINAL assume true; 8158#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8157#func_to_recursive_line_27_to_27_0FINAL assume true; 8156#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8155#func_to_recursive_line_27_to_27_0FINAL assume true; 8154#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8153#func_to_recursive_line_27_to_27_0FINAL assume true; 8152#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8151#func_to_recursive_line_27_to_27_0FINAL assume true; 8150#func_to_recursive_line_27_to_27_0EXIT >#65#return; 8149#func_to_recursive_line_27_to_27_0FINAL assume true; 8148#func_to_recursive_line_27_to_27_0EXIT >#69#return; 8138#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 8126#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 8135#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 8131#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8124#func_to_recursive_line_26_to_27_0FINAL assume true; 8127#func_to_recursive_line_26_to_27_0EXIT >#67#return; 8130#func_to_recursive_line_26_to_27_0FINAL assume true; 8161#func_to_recursive_line_26_to_27_0EXIT >#67#return; 8160#func_to_recursive_line_26_to_27_0FINAL assume true; 8159#func_to_recursive_line_26_to_27_0EXIT >#63#return; 8129#L67 call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 8122#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 8132#func_to_recursive_line_25_to_26_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4); 8140#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 8128#func_to_recursive_line_25_to_26_0FINAL assume true; 8121#func_to_recursive_line_25_to_26_0EXIT >#61#return; 8123#func_to_recursive_line_25_to_26_0FINAL assume true; 8147#func_to_recursive_line_25_to_26_0EXIT >#61#return; 8145#func_to_recursive_line_25_to_26_0FINAL assume true; 8144#func_to_recursive_line_25_to_26_0EXIT >#59#return; 8139#L87 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 8113#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 8107#func_to_recursive_line_24_to_25_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 8112#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 8115#func_to_recursive_line_24_to_25_0FINAL assume true; 8118#func_to_recursive_line_24_to_25_0EXIT >#57#return; 8141#func_to_recursive_line_24_to_25_0FINAL assume true; 8146#func_to_recursive_line_24_to_25_0EXIT >#57#return; 8143#func_to_recursive_line_24_to_25_0FINAL assume true; 8142#func_to_recursive_line_24_to_25_0EXIT >#73#return; 8116#L107 call #t~mem17 := read~int#1(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#1(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 8106#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 8133#func_to_recursive_line_23_to_24_0ENTRY [2024-11-10 23:19:23,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:19:23,099 INFO L85 PathProgramCache]: Analyzing trace with hash 83402, now seen corresponding path program 9 times [2024-11-10 23:19:23,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:19:23,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700440256] [2024-11-10 23:19:23,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:19:23,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:19:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:19:23,113 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:19:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:19:23,122 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:19:23,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:19:23,123 INFO L85 PathProgramCache]: Analyzing trace with hash 824171036, now seen corresponding path program 5 times [2024-11-10 23:19:23,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:19:23,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20077129] [2024-11-10 23:19:23,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:19:23,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:19:23,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:24,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:25,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:26,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:26,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:26,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:26,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:26,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:26,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:26,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:26,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:26,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:26,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:26,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:26,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:26,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:26,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:26,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:26,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:26,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:26,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:26,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:26,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:26,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:26,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:26,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:26,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:26,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:26,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:26,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:26,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:26,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:26,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:26,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:26,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 23:19:26,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:26,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:26,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:26,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:26,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:26,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:26,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:26,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:26,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:26,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:26,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:26,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:26,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:26,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:26,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:26,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:26,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:27,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:27,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:27,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:27,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:27,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:27,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:27,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:27,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 23:19:27,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-10 23:19:27,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:27,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:27,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:27,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:27,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:27,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:27,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:27,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:27,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:27,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:27,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:27,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:27,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:27,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:27,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:27,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:27,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:27,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 23:19:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:27,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:27,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:27,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:27,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:27,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:27,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:27,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:27,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:27,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:27,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:27,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 23:19:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-10 23:19:27,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:27,478 INFO L134 CoverageAnalysis]: Checked inductivity of 7729 backedges. 54 proven. 107 refuted. 0 times theorem prover too weak. 7568 trivial. 0 not checked. [2024-11-10 23:19:27,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:19:27,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20077129] [2024-11-10 23:19:27,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20077129] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 23:19:27,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803696625] [2024-11-10 23:19:27,478 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-10 23:19:27,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 23:19:27,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:19:27,481 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:27,482 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:31,935 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2024-11-10 23:19:31,935 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 23:19:31,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 1830 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-10 23:19:31,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:19:31,974 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:32,201 INFO L134 CoverageAnalysis]: Checked inductivity of 7729 backedges. 2946 proven. 8 refuted. 0 times theorem prover too weak. 4775 trivial. 0 not checked. [2024-11-10 23:19:32,201 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 23:19:34,050 INFO L134 CoverageAnalysis]: Checked inductivity of 7729 backedges. 8 proven. 176 refuted. 0 times theorem prover too weak. 7545 trivial. 0 not checked. [2024-11-10 23:19:34,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803696625] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 23:19:34,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 23:19:34,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 14] total 33 [2024-11-10 23:19:34,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516342496] [2024-11-10 23:19:34,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 23:19:34,052 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:19:34,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:19:34,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-10 23:19:34,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=883, Unknown=0, NotChecked=0, Total=1056 [2024-11-10 23:19:34,053 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. cyclomatic complexity: 13 Second operand has 33 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 25 states have internal predecessors, (76), 15 states have call successors, (42), 10 states have call predecessors, (42), 9 states have return successors, (33), 11 states have call predecessors, (33), 15 states have call successors, (33) [2024-11-10 23:19:34,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:19:34,535 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2024-11-10 23:19:34,535 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 70 transitions. [2024-11-10 23:19:34,536 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-10 23:19:34,537 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 62 states and 70 transitions. [2024-11-10 23:19:34,540 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2024-11-10 23:19:34,540 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2024-11-10 23:19:34,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 70 transitions. [2024-11-10 23:19:34,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:19:34,541 INFO L218 hiAutomatonCegarLoop]: Abstraction has 62 states and 70 transitions. [2024-11-10 23:19:34,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 70 transitions. [2024-11-10 23:19:34,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-10 23:19:34,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 38 states have internal predecessors, (38), 10 states have call successors, (10), 5 states have call predecessors, (10), 18 states have return successors, (22), 18 states have call predecessors, (22), 8 states have call successors, (22) [2024-11-10 23:19:34,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2024-11-10 23:19:34,551 INFO L240 hiAutomatonCegarLoop]: Abstraction has 62 states and 70 transitions. [2024-11-10 23:19:34,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 23:19:34,552 INFO L425 stractBuchiCegarLoop]: Abstraction has 62 states and 70 transitions. [2024-11-10 23:19:34,553 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-10 23:19:34,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 70 transitions. [2024-11-10 23:19:34,554 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-10 23:19:34,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:19:34,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:19:34,560 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-10 23:19:34,561 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [112, 112, 96, 96, 96, 20, 20, 16, 16, 16, 16, 16, 16, 16, 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:34,561 INFO L745 eck$LassoCheckResult]: Stem: 13507#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); 13508#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#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#3(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#2(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#5(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 13476#L128-1 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 13504#func_to_recursive_line_23_to_24_0ENTRY [2024-11-10 23:19:34,562 INFO L747 eck$LassoCheckResult]: Loop: 13504#func_to_recursive_line_23_to_24_0ENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#1(~a.base, ~a.offset, 4); 13488#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4); 13475#L107-1 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 13478#func_to_recursive_line_24_to_25_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 13483#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4); 13485#L87-1 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 13503#func_to_recursive_line_25_to_26_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4); 13511#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4); 13496#L67-1 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 13506#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 13502#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 13481#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 13505#func_to_recursive_line_27_to_27_0FINAL assume true; 13490#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13491#func_to_recursive_line_27_to_27_0FINAL assume true; 13529#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13528#func_to_recursive_line_27_to_27_0FINAL assume true; 13527#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13526#func_to_recursive_line_27_to_27_0FINAL assume true; 13525#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13524#func_to_recursive_line_27_to_27_0FINAL assume true; 13523#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13522#func_to_recursive_line_27_to_27_0FINAL assume true; 13521#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13520#func_to_recursive_line_27_to_27_0FINAL assume true; 13519#func_to_recursive_line_27_to_27_0EXIT >#69#return; 13509#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 13497#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 13506#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 13502#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 13481#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 13505#func_to_recursive_line_27_to_27_0FINAL assume true; 13490#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13491#func_to_recursive_line_27_to_27_0FINAL assume true; 13529#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13528#func_to_recursive_line_27_to_27_0FINAL assume true; 13527#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13526#func_to_recursive_line_27_to_27_0FINAL assume true; 13525#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13524#func_to_recursive_line_27_to_27_0FINAL assume true; 13523#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13522#func_to_recursive_line_27_to_27_0FINAL assume true; 13521#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13520#func_to_recursive_line_27_to_27_0FINAL assume true; 13519#func_to_recursive_line_27_to_27_0EXIT >#69#return; 13509#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 13497#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 13506#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 13502#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 13481#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 13505#func_to_recursive_line_27_to_27_0FINAL assume true; 13490#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13491#func_to_recursive_line_27_to_27_0FINAL assume true; 13529#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13528#func_to_recursive_line_27_to_27_0FINAL assume true; 13527#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13526#func_to_recursive_line_27_to_27_0FINAL assume true; 13525#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13524#func_to_recursive_line_27_to_27_0FINAL assume true; 13523#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13522#func_to_recursive_line_27_to_27_0FINAL assume true; 13521#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13520#func_to_recursive_line_27_to_27_0FINAL assume true; 13519#func_to_recursive_line_27_to_27_0EXIT >#69#return; 13509#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 13497#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 13506#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 13502#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 13481#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 13505#func_to_recursive_line_27_to_27_0FINAL assume true; 13490#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13491#func_to_recursive_line_27_to_27_0FINAL assume true; 13529#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13528#func_to_recursive_line_27_to_27_0FINAL assume true; 13527#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13526#func_to_recursive_line_27_to_27_0FINAL assume true; 13525#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13524#func_to_recursive_line_27_to_27_0FINAL assume true; 13523#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13522#func_to_recursive_line_27_to_27_0FINAL assume true; 13521#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13520#func_to_recursive_line_27_to_27_0FINAL assume true; 13519#func_to_recursive_line_27_to_27_0EXIT >#69#return; 13509#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 13497#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 13506#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 13502#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 13495#func_to_recursive_line_26_to_27_0FINAL assume true; 13498#func_to_recursive_line_26_to_27_0EXIT >#67#return; 13501#func_to_recursive_line_26_to_27_0FINAL assume true; 13536#func_to_recursive_line_26_to_27_0EXIT >#67#return; 13535#func_to_recursive_line_26_to_27_0FINAL assume true; 13534#func_to_recursive_line_26_to_27_0EXIT >#67#return; 13533#func_to_recursive_line_26_to_27_0FINAL assume true; 13532#func_to_recursive_line_26_to_27_0EXIT >#67#return; 13531#func_to_recursive_line_26_to_27_0FINAL assume true; 13530#func_to_recursive_line_26_to_27_0EXIT >#63#return; 13500#L67 call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 13493#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 13503#func_to_recursive_line_25_to_26_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4); 13511#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4); 13496#L67-1 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 13506#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 13502#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 13481#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 13505#func_to_recursive_line_27_to_27_0FINAL assume true; 13490#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13491#func_to_recursive_line_27_to_27_0FINAL assume true; 13529#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13528#func_to_recursive_line_27_to_27_0FINAL assume true; 13527#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13526#func_to_recursive_line_27_to_27_0FINAL assume true; 13525#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13524#func_to_recursive_line_27_to_27_0FINAL assume true; 13523#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13522#func_to_recursive_line_27_to_27_0FINAL assume true; 13521#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13520#func_to_recursive_line_27_to_27_0FINAL assume true; 13519#func_to_recursive_line_27_to_27_0EXIT >#69#return; 13509#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 13497#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 13506#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 13502#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 13481#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 13505#func_to_recursive_line_27_to_27_0FINAL assume true; 13490#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13491#func_to_recursive_line_27_to_27_0FINAL assume true; 13529#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13528#func_to_recursive_line_27_to_27_0FINAL assume true; 13527#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13526#func_to_recursive_line_27_to_27_0FINAL assume true; 13525#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13524#func_to_recursive_line_27_to_27_0FINAL assume true; 13523#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13522#func_to_recursive_line_27_to_27_0FINAL assume true; 13521#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13520#func_to_recursive_line_27_to_27_0FINAL assume true; 13519#func_to_recursive_line_27_to_27_0EXIT >#69#return; 13509#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 13497#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 13506#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 13502#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 13481#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 13505#func_to_recursive_line_27_to_27_0FINAL assume true; 13490#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13491#func_to_recursive_line_27_to_27_0FINAL assume true; 13529#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13528#func_to_recursive_line_27_to_27_0FINAL assume true; 13527#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13526#func_to_recursive_line_27_to_27_0FINAL assume true; 13525#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13524#func_to_recursive_line_27_to_27_0FINAL assume true; 13523#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13522#func_to_recursive_line_27_to_27_0FINAL assume true; 13521#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13520#func_to_recursive_line_27_to_27_0FINAL assume true; 13519#func_to_recursive_line_27_to_27_0EXIT >#69#return; 13509#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 13497#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 13506#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 13502#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 13481#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 13505#func_to_recursive_line_27_to_27_0FINAL assume true; 13490#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13491#func_to_recursive_line_27_to_27_0FINAL assume true; 13529#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13528#func_to_recursive_line_27_to_27_0FINAL assume true; 13527#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13526#func_to_recursive_line_27_to_27_0FINAL assume true; 13525#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13524#func_to_recursive_line_27_to_27_0FINAL assume true; 13523#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13522#func_to_recursive_line_27_to_27_0FINAL assume true; 13521#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13520#func_to_recursive_line_27_to_27_0FINAL assume true; 13519#func_to_recursive_line_27_to_27_0EXIT >#69#return; 13509#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 13497#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 13506#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 13502#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 13495#func_to_recursive_line_26_to_27_0FINAL assume true; 13498#func_to_recursive_line_26_to_27_0EXIT >#67#return; 13501#func_to_recursive_line_26_to_27_0FINAL assume true; 13536#func_to_recursive_line_26_to_27_0EXIT >#67#return; 13535#func_to_recursive_line_26_to_27_0FINAL assume true; 13534#func_to_recursive_line_26_to_27_0EXIT >#67#return; 13533#func_to_recursive_line_26_to_27_0FINAL assume true; 13532#func_to_recursive_line_26_to_27_0EXIT >#67#return; 13531#func_to_recursive_line_26_to_27_0FINAL assume true; 13530#func_to_recursive_line_26_to_27_0EXIT >#63#return; 13500#L67 call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 13493#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 13503#func_to_recursive_line_25_to_26_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4); 13511#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 13499#func_to_recursive_line_25_to_26_0FINAL assume true; 13492#func_to_recursive_line_25_to_26_0EXIT >#61#return; 13494#func_to_recursive_line_25_to_26_0FINAL assume true; 13518#func_to_recursive_line_25_to_26_0EXIT >#61#return; 13516#func_to_recursive_line_25_to_26_0FINAL assume true; 13515#func_to_recursive_line_25_to_26_0EXIT >#59#return; 13510#L87 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 13484#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 13478#func_to_recursive_line_24_to_25_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 13483#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4); 13485#L87-1 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 13503#func_to_recursive_line_25_to_26_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4); 13511#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4); 13496#L67-1 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 13506#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 13502#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 13481#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 13505#func_to_recursive_line_27_to_27_0FINAL assume true; 13490#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13491#func_to_recursive_line_27_to_27_0FINAL assume true; 13529#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13528#func_to_recursive_line_27_to_27_0FINAL assume true; 13527#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13526#func_to_recursive_line_27_to_27_0FINAL assume true; 13525#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13524#func_to_recursive_line_27_to_27_0FINAL assume true; 13523#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13522#func_to_recursive_line_27_to_27_0FINAL assume true; 13521#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13520#func_to_recursive_line_27_to_27_0FINAL assume true; 13519#func_to_recursive_line_27_to_27_0EXIT >#69#return; 13509#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 13497#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 13506#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 13502#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 13481#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 13505#func_to_recursive_line_27_to_27_0FINAL assume true; 13490#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13491#func_to_recursive_line_27_to_27_0FINAL assume true; 13529#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13528#func_to_recursive_line_27_to_27_0FINAL assume true; 13527#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13526#func_to_recursive_line_27_to_27_0FINAL assume true; 13525#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13524#func_to_recursive_line_27_to_27_0FINAL assume true; 13523#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13522#func_to_recursive_line_27_to_27_0FINAL assume true; 13521#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13520#func_to_recursive_line_27_to_27_0FINAL assume true; 13519#func_to_recursive_line_27_to_27_0EXIT >#69#return; 13509#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 13497#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 13506#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 13502#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 13481#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 13505#func_to_recursive_line_27_to_27_0FINAL assume true; 13490#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13491#func_to_recursive_line_27_to_27_0FINAL assume true; 13529#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13528#func_to_recursive_line_27_to_27_0FINAL assume true; 13527#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13526#func_to_recursive_line_27_to_27_0FINAL assume true; 13525#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13524#func_to_recursive_line_27_to_27_0FINAL assume true; 13523#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13522#func_to_recursive_line_27_to_27_0FINAL assume true; 13521#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13520#func_to_recursive_line_27_to_27_0FINAL assume true; 13519#func_to_recursive_line_27_to_27_0EXIT >#69#return; 13509#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 13497#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 13506#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 13502#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 13481#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 13505#func_to_recursive_line_27_to_27_0FINAL assume true; 13490#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13491#func_to_recursive_line_27_to_27_0FINAL assume true; 13529#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13528#func_to_recursive_line_27_to_27_0FINAL assume true; 13527#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13526#func_to_recursive_line_27_to_27_0FINAL assume true; 13525#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13524#func_to_recursive_line_27_to_27_0FINAL assume true; 13523#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13522#func_to_recursive_line_27_to_27_0FINAL assume true; 13521#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13520#func_to_recursive_line_27_to_27_0FINAL assume true; 13519#func_to_recursive_line_27_to_27_0EXIT >#69#return; 13509#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 13497#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 13506#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 13502#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 13495#func_to_recursive_line_26_to_27_0FINAL assume true; 13498#func_to_recursive_line_26_to_27_0EXIT >#67#return; 13501#func_to_recursive_line_26_to_27_0FINAL assume true; 13536#func_to_recursive_line_26_to_27_0EXIT >#67#return; 13535#func_to_recursive_line_26_to_27_0FINAL assume true; 13534#func_to_recursive_line_26_to_27_0EXIT >#67#return; 13533#func_to_recursive_line_26_to_27_0FINAL assume true; 13532#func_to_recursive_line_26_to_27_0EXIT >#67#return; 13531#func_to_recursive_line_26_to_27_0FINAL assume true; 13530#func_to_recursive_line_26_to_27_0EXIT >#63#return; 13500#L67 call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 13493#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 13503#func_to_recursive_line_25_to_26_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4); 13511#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4); 13496#L67-1 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 13506#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 13502#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 13481#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 13505#func_to_recursive_line_27_to_27_0FINAL assume true; 13490#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13491#func_to_recursive_line_27_to_27_0FINAL assume true; 13529#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13528#func_to_recursive_line_27_to_27_0FINAL assume true; 13527#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13526#func_to_recursive_line_27_to_27_0FINAL assume true; 13525#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13524#func_to_recursive_line_27_to_27_0FINAL assume true; 13523#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13522#func_to_recursive_line_27_to_27_0FINAL assume true; 13521#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13520#func_to_recursive_line_27_to_27_0FINAL assume true; 13519#func_to_recursive_line_27_to_27_0EXIT >#69#return; 13509#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 13497#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 13506#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 13502#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 13481#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 13505#func_to_recursive_line_27_to_27_0FINAL assume true; 13490#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13491#func_to_recursive_line_27_to_27_0FINAL assume true; 13529#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13528#func_to_recursive_line_27_to_27_0FINAL assume true; 13527#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13526#func_to_recursive_line_27_to_27_0FINAL assume true; 13525#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13524#func_to_recursive_line_27_to_27_0FINAL assume true; 13523#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13522#func_to_recursive_line_27_to_27_0FINAL assume true; 13521#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13520#func_to_recursive_line_27_to_27_0FINAL assume true; 13519#func_to_recursive_line_27_to_27_0EXIT >#69#return; 13509#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 13497#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 13506#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 13502#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 13481#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 13505#func_to_recursive_line_27_to_27_0FINAL assume true; 13490#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13491#func_to_recursive_line_27_to_27_0FINAL assume true; 13529#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13528#func_to_recursive_line_27_to_27_0FINAL assume true; 13527#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13526#func_to_recursive_line_27_to_27_0FINAL assume true; 13525#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13524#func_to_recursive_line_27_to_27_0FINAL assume true; 13523#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13522#func_to_recursive_line_27_to_27_0FINAL assume true; 13521#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13520#func_to_recursive_line_27_to_27_0FINAL assume true; 13519#func_to_recursive_line_27_to_27_0EXIT >#69#return; 13509#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 13497#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 13506#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 13502#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 13481#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 13480#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 13479#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 13482#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 13505#func_to_recursive_line_27_to_27_0FINAL assume true; 13490#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13491#func_to_recursive_line_27_to_27_0FINAL assume true; 13529#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13528#func_to_recursive_line_27_to_27_0FINAL assume true; 13527#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13526#func_to_recursive_line_27_to_27_0FINAL assume true; 13525#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13524#func_to_recursive_line_27_to_27_0FINAL assume true; 13523#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13522#func_to_recursive_line_27_to_27_0FINAL assume true; 13521#func_to_recursive_line_27_to_27_0EXIT >#65#return; 13520#func_to_recursive_line_27_to_27_0FINAL assume true; 13519#func_to_recursive_line_27_to_27_0EXIT >#69#return; 13509#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 13497#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 13506#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 13502#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 13495#func_to_recursive_line_26_to_27_0FINAL assume true; 13498#func_to_recursive_line_26_to_27_0EXIT >#67#return; 13501#func_to_recursive_line_26_to_27_0FINAL assume true; 13536#func_to_recursive_line_26_to_27_0EXIT >#67#return; 13535#func_to_recursive_line_26_to_27_0FINAL assume true; 13534#func_to_recursive_line_26_to_27_0EXIT >#67#return; 13533#func_to_recursive_line_26_to_27_0FINAL assume true; 13532#func_to_recursive_line_26_to_27_0EXIT >#67#return; 13531#func_to_recursive_line_26_to_27_0FINAL assume true; 13530#func_to_recursive_line_26_to_27_0EXIT >#63#return; 13500#L67 call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 13493#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 13503#func_to_recursive_line_25_to_26_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4); 13511#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 13499#func_to_recursive_line_25_to_26_0FINAL assume true; 13492#func_to_recursive_line_25_to_26_0EXIT >#61#return; 13494#func_to_recursive_line_25_to_26_0FINAL assume true; 13518#func_to_recursive_line_25_to_26_0EXIT >#61#return; 13516#func_to_recursive_line_25_to_26_0FINAL assume true; 13515#func_to_recursive_line_25_to_26_0EXIT >#59#return; 13510#L87 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 13484#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 13478#func_to_recursive_line_24_to_25_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 13483#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 13486#func_to_recursive_line_24_to_25_0FINAL assume true; 13489#func_to_recursive_line_24_to_25_0EXIT >#57#return; 13512#func_to_recursive_line_24_to_25_0FINAL assume true; 13517#func_to_recursive_line_24_to_25_0EXIT >#57#return; 13514#func_to_recursive_line_24_to_25_0FINAL assume true; 13513#func_to_recursive_line_24_to_25_0EXIT >#73#return; 13487#L107 call #t~mem17 := read~int#1(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#1(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 13477#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 13504#func_to_recursive_line_23_to_24_0ENTRY [2024-11-10 23:19:34,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:19:34,564 INFO L85 PathProgramCache]: Analyzing trace with hash 83402, now seen corresponding path program 10 times [2024-11-10 23:19:34,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:19:34,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547520163] [2024-11-10 23:19:34,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:19:34,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:19:34,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:19:34,576 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:19:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:19:34,588 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:19:34,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:19:34,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1664507620, now seen corresponding path program 6 times [2024-11-10 23:19:34,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:19:34,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902056390] [2024-11-10 23:19:34,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:19:34,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:19:34,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:37,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:37,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:40,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:40,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:42,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:42,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:42,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:42,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:42,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:42,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 23:19:42,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:43,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:43,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:43,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:43,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:43,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:43,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:43,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:43,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:43,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:43,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:43,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:43,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:43,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:43,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:43,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:43,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:43,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:44,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:44,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:44,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:44,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:44,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:44,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:44,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:44,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:44,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:44,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:44,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:44,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:44,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:44,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:44,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:44,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:44,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:44,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:44,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:44,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:44,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:44,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:44,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:44,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:44,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:44,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:44,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:44,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:44,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:44,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:44,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:44,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:44,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:44,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:44,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:44,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:44,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:44,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:44,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:44,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:44,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:44,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 23:19:44,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:44,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2024-11-10 23:19:44,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:44,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:44,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:45,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:45,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:45,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:45,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 23:19:45,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:45,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:45,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:19:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 23:19:45,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2024-11-10 23:19:45,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:45,535 INFO L134 CoverageAnalysis]: Checked inductivity of 30637 backedges. 134 proven. 290 refuted. 0 times theorem prover too weak. 30213 trivial. 0 not checked. [2024-11-10 23:19:45,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:19:45,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902056390] [2024-11-10 23:19:45,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902056390] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 23:19:45,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896391942] [2024-11-10 23:19:45,536 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-10 23:19:45,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 23:19:45,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:19:45,537 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:45,538 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:46,021 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-11-10 23:19:46,021 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 23:19:46,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-10 23:19:46,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:19:46,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:46,232 INFO L134 CoverageAnalysis]: Checked inductivity of 30637 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 30629 trivial. 0 not checked. [2024-11-10 23:19:46,232 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 23:19:49,174 INFO L134 CoverageAnalysis]: Checked inductivity of 30637 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 30622 trivial. 0 not checked. [2024-11-10 23:19:49,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896391942] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 23:19:49,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 23:19:49,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 14] total 35 [2024-11-10 23:19:49,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722925538] [2024-11-10 23:19:49,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 23:19:49,176 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:19:49,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:19:49,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-10 23:19:49,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1036, Unknown=0, NotChecked=0, Total=1190 [2024-11-10 23:19:49,178 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. cyclomatic complexity: 13 Second operand has 35 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 27 states have internal predecessors, (61), 13 states have call successors, (27), 10 states have call predecessors, (27), 13 states have return successors, (27), 14 states have call predecessors, (27), 13 states have call successors, (27) [2024-11-10 23:19:49,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:19:49,822 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2024-11-10 23:19:49,823 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 74 transitions. [2024-11-10 23:19:49,824 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-10 23:19:49,826 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 66 states and 74 transitions. [2024-11-10 23:19:49,826 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2024-11-10 23:19:49,827 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2024-11-10 23:19:49,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 74 transitions. [2024-11-10 23:19:49,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:19:49,827 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66 states and 74 transitions. [2024-11-10 23:19:49,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 74 transitions. [2024-11-10 23:19:49,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-10 23:19:49,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 40 states have internal predecessors, (40), 10 states have call successors, (10), 5 states have call predecessors, (10), 20 states have return successors, (24), 20 states have call predecessors, (24), 8 states have call successors, (24) [2024-11-10 23:19:49,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2024-11-10 23:19:49,834 INFO L240 hiAutomatonCegarLoop]: Abstraction has 66 states and 74 transitions. [2024-11-10 23:19:49,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-10 23:19:49,839 INFO L425 stractBuchiCegarLoop]: Abstraction has 66 states and 74 transitions. [2024-11-10 23:19:49,839 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-10 23:19:49,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 74 transitions. [2024-11-10 23:19:49,840 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-10 23:19:49,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:19:49,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:19:49,848 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-10 23:19:49,852 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [210, 210, 180, 180, 180, 36, 36, 30, 30, 30, 30, 30, 30, 30, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:19:49,852 INFO L745 eck$LassoCheckResult]: Stem: 24098#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); 24099#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#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#3(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#2(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#5(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 24068#L128-1 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 24095#func_to_recursive_line_23_to_24_0ENTRY [2024-11-10 23:19:49,853 INFO L747 eck$LassoCheckResult]: Loop: 24095#func_to_recursive_line_23_to_24_0ENTRY ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#1(~a.base, ~a.offset, 4); 24079#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#3(0, ~b.base, ~b.offset, 4); 24066#L107-1 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 24069#func_to_recursive_line_24_to_25_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 24074#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4); 24076#L87-1 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 24094#func_to_recursive_line_25_to_26_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4); 24102#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4); 24088#L67-1 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24097#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 24093#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 24071#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24096#func_to_recursive_line_27_to_27_0FINAL assume true; 24084#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24085#func_to_recursive_line_27_to_27_0FINAL assume true; 24131#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24130#func_to_recursive_line_27_to_27_0FINAL assume true; 24128#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24126#func_to_recursive_line_27_to_27_0FINAL assume true; 24125#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24123#func_to_recursive_line_27_to_27_0FINAL assume true; 24120#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24118#func_to_recursive_line_27_to_27_0FINAL assume true; 24117#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24113#func_to_recursive_line_27_to_27_0FINAL assume true; 24112#func_to_recursive_line_27_to_27_0EXIT >#69#return; 24100#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 24087#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24097#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 24093#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 24071#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24096#func_to_recursive_line_27_to_27_0FINAL assume true; 24084#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24085#func_to_recursive_line_27_to_27_0FINAL assume true; 24131#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24130#func_to_recursive_line_27_to_27_0FINAL assume true; 24128#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24126#func_to_recursive_line_27_to_27_0FINAL assume true; 24125#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24123#func_to_recursive_line_27_to_27_0FINAL assume true; 24120#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24118#func_to_recursive_line_27_to_27_0FINAL assume true; 24117#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24113#func_to_recursive_line_27_to_27_0FINAL assume true; 24112#func_to_recursive_line_27_to_27_0EXIT >#69#return; 24100#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 24087#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24097#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 24093#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 24071#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24096#func_to_recursive_line_27_to_27_0FINAL assume true; 24084#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24085#func_to_recursive_line_27_to_27_0FINAL assume true; 24131#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24130#func_to_recursive_line_27_to_27_0FINAL assume true; 24128#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24126#func_to_recursive_line_27_to_27_0FINAL assume true; 24125#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24123#func_to_recursive_line_27_to_27_0FINAL assume true; 24120#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24118#func_to_recursive_line_27_to_27_0FINAL assume true; 24117#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24113#func_to_recursive_line_27_to_27_0FINAL assume true; 24112#func_to_recursive_line_27_to_27_0EXIT >#69#return; 24100#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 24087#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24097#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 24093#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 24071#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24096#func_to_recursive_line_27_to_27_0FINAL assume true; 24084#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24085#func_to_recursive_line_27_to_27_0FINAL assume true; 24131#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24130#func_to_recursive_line_27_to_27_0FINAL assume true; 24128#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24126#func_to_recursive_line_27_to_27_0FINAL assume true; 24125#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24123#func_to_recursive_line_27_to_27_0FINAL assume true; 24120#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24118#func_to_recursive_line_27_to_27_0FINAL assume true; 24117#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24113#func_to_recursive_line_27_to_27_0FINAL assume true; 24112#func_to_recursive_line_27_to_27_0EXIT >#69#return; 24100#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 24087#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24097#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 24093#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 24071#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24096#func_to_recursive_line_27_to_27_0FINAL assume true; 24084#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24085#func_to_recursive_line_27_to_27_0FINAL assume true; 24131#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24130#func_to_recursive_line_27_to_27_0FINAL assume true; 24128#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24126#func_to_recursive_line_27_to_27_0FINAL assume true; 24125#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24123#func_to_recursive_line_27_to_27_0FINAL assume true; 24120#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24118#func_to_recursive_line_27_to_27_0FINAL assume true; 24117#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24113#func_to_recursive_line_27_to_27_0FINAL assume true; 24112#func_to_recursive_line_27_to_27_0EXIT >#69#return; 24100#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 24087#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24097#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 24093#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 24086#func_to_recursive_line_26_to_27_0FINAL assume true; 24089#func_to_recursive_line_26_to_27_0EXIT >#67#return; 24092#func_to_recursive_line_26_to_27_0FINAL assume true; 24129#func_to_recursive_line_26_to_27_0EXIT >#67#return; 24127#func_to_recursive_line_26_to_27_0FINAL assume true; 24124#func_to_recursive_line_26_to_27_0EXIT >#67#return; 24122#func_to_recursive_line_26_to_27_0FINAL assume true; 24121#func_to_recursive_line_26_to_27_0EXIT >#67#return; 24119#func_to_recursive_line_26_to_27_0FINAL assume true; 24116#func_to_recursive_line_26_to_27_0EXIT >#67#return; 24115#func_to_recursive_line_26_to_27_0FINAL assume true; 24114#func_to_recursive_line_26_to_27_0EXIT >#63#return; 24091#L67 call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 24082#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 24094#func_to_recursive_line_25_to_26_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4); 24102#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4); 24088#L67-1 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24097#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 24093#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 24071#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24096#func_to_recursive_line_27_to_27_0FINAL assume true; 24084#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24085#func_to_recursive_line_27_to_27_0FINAL assume true; 24131#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24130#func_to_recursive_line_27_to_27_0FINAL assume true; 24128#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24126#func_to_recursive_line_27_to_27_0FINAL assume true; 24125#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24123#func_to_recursive_line_27_to_27_0FINAL assume true; 24120#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24118#func_to_recursive_line_27_to_27_0FINAL assume true; 24117#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24113#func_to_recursive_line_27_to_27_0FINAL assume true; 24112#func_to_recursive_line_27_to_27_0EXIT >#69#return; 24100#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 24087#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24097#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 24093#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 24071#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24096#func_to_recursive_line_27_to_27_0FINAL assume true; 24084#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24085#func_to_recursive_line_27_to_27_0FINAL assume true; 24131#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24130#func_to_recursive_line_27_to_27_0FINAL assume true; 24128#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24126#func_to_recursive_line_27_to_27_0FINAL assume true; 24125#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24123#func_to_recursive_line_27_to_27_0FINAL assume true; 24120#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24118#func_to_recursive_line_27_to_27_0FINAL assume true; 24117#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24113#func_to_recursive_line_27_to_27_0FINAL assume true; 24112#func_to_recursive_line_27_to_27_0EXIT >#69#return; 24100#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 24087#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24097#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 24093#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 24071#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24096#func_to_recursive_line_27_to_27_0FINAL assume true; 24084#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24085#func_to_recursive_line_27_to_27_0FINAL assume true; 24131#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24130#func_to_recursive_line_27_to_27_0FINAL assume true; 24128#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24126#func_to_recursive_line_27_to_27_0FINAL assume true; 24125#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24123#func_to_recursive_line_27_to_27_0FINAL assume true; 24120#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24118#func_to_recursive_line_27_to_27_0FINAL assume true; 24117#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24113#func_to_recursive_line_27_to_27_0FINAL assume true; 24112#func_to_recursive_line_27_to_27_0EXIT >#69#return; 24100#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 24087#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24097#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 24093#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 24071#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24096#func_to_recursive_line_27_to_27_0FINAL assume true; 24084#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24085#func_to_recursive_line_27_to_27_0FINAL assume true; 24131#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24130#func_to_recursive_line_27_to_27_0FINAL assume true; 24128#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24126#func_to_recursive_line_27_to_27_0FINAL assume true; 24125#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24123#func_to_recursive_line_27_to_27_0FINAL assume true; 24120#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24118#func_to_recursive_line_27_to_27_0FINAL assume true; 24117#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24113#func_to_recursive_line_27_to_27_0FINAL assume true; 24112#func_to_recursive_line_27_to_27_0EXIT >#69#return; 24100#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 24087#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24097#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 24093#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 24071#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24096#func_to_recursive_line_27_to_27_0FINAL assume true; 24084#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24085#func_to_recursive_line_27_to_27_0FINAL assume true; 24131#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24130#func_to_recursive_line_27_to_27_0FINAL assume true; 24128#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24126#func_to_recursive_line_27_to_27_0FINAL assume true; 24125#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24123#func_to_recursive_line_27_to_27_0FINAL assume true; 24120#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24118#func_to_recursive_line_27_to_27_0FINAL assume true; 24117#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24113#func_to_recursive_line_27_to_27_0FINAL assume true; 24112#func_to_recursive_line_27_to_27_0EXIT >#69#return; 24100#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 24087#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24097#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 24093#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 24086#func_to_recursive_line_26_to_27_0FINAL assume true; 24089#func_to_recursive_line_26_to_27_0EXIT >#67#return; 24092#func_to_recursive_line_26_to_27_0FINAL assume true; 24129#func_to_recursive_line_26_to_27_0EXIT >#67#return; 24127#func_to_recursive_line_26_to_27_0FINAL assume true; 24124#func_to_recursive_line_26_to_27_0EXIT >#67#return; 24122#func_to_recursive_line_26_to_27_0FINAL assume true; 24121#func_to_recursive_line_26_to_27_0EXIT >#67#return; 24119#func_to_recursive_line_26_to_27_0FINAL assume true; 24116#func_to_recursive_line_26_to_27_0EXIT >#67#return; 24115#func_to_recursive_line_26_to_27_0FINAL assume true; 24114#func_to_recursive_line_26_to_27_0EXIT >#63#return; 24091#L67 call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 24082#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 24094#func_to_recursive_line_25_to_26_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4); 24102#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 24090#func_to_recursive_line_25_to_26_0FINAL assume true; 24081#func_to_recursive_line_25_to_26_0EXIT >#61#return; 24083#func_to_recursive_line_25_to_26_0FINAL assume true; 24111#func_to_recursive_line_25_to_26_0EXIT >#61#return; 24107#func_to_recursive_line_25_to_26_0FINAL assume true; 24106#func_to_recursive_line_25_to_26_0EXIT >#59#return; 24101#L87 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 24075#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 24069#func_to_recursive_line_24_to_25_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 24074#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4); 24076#L87-1 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 24094#func_to_recursive_line_25_to_26_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4); 24102#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4); 24088#L67-1 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24097#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 24093#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 24071#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24096#func_to_recursive_line_27_to_27_0FINAL assume true; 24084#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24085#func_to_recursive_line_27_to_27_0FINAL assume true; 24131#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24130#func_to_recursive_line_27_to_27_0FINAL assume true; 24128#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24126#func_to_recursive_line_27_to_27_0FINAL assume true; 24125#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24123#func_to_recursive_line_27_to_27_0FINAL assume true; 24120#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24118#func_to_recursive_line_27_to_27_0FINAL assume true; 24117#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24113#func_to_recursive_line_27_to_27_0FINAL assume true; 24112#func_to_recursive_line_27_to_27_0EXIT >#69#return; 24100#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 24087#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24097#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 24093#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 24071#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24096#func_to_recursive_line_27_to_27_0FINAL assume true; 24084#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24085#func_to_recursive_line_27_to_27_0FINAL assume true; 24131#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24130#func_to_recursive_line_27_to_27_0FINAL assume true; 24128#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24126#func_to_recursive_line_27_to_27_0FINAL assume true; 24125#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24123#func_to_recursive_line_27_to_27_0FINAL assume true; 24120#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24118#func_to_recursive_line_27_to_27_0FINAL assume true; 24117#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24113#func_to_recursive_line_27_to_27_0FINAL assume true; 24112#func_to_recursive_line_27_to_27_0EXIT >#69#return; 24100#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 24087#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24097#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 24093#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 24071#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24096#func_to_recursive_line_27_to_27_0FINAL assume true; 24084#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24085#func_to_recursive_line_27_to_27_0FINAL assume true; 24131#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24130#func_to_recursive_line_27_to_27_0FINAL assume true; 24128#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24126#func_to_recursive_line_27_to_27_0FINAL assume true; 24125#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24123#func_to_recursive_line_27_to_27_0FINAL assume true; 24120#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24118#func_to_recursive_line_27_to_27_0FINAL assume true; 24117#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24113#func_to_recursive_line_27_to_27_0FINAL assume true; 24112#func_to_recursive_line_27_to_27_0EXIT >#69#return; 24100#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 24087#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24097#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 24093#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 24071#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24096#func_to_recursive_line_27_to_27_0FINAL assume true; 24084#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24085#func_to_recursive_line_27_to_27_0FINAL assume true; 24131#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24130#func_to_recursive_line_27_to_27_0FINAL assume true; 24128#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24126#func_to_recursive_line_27_to_27_0FINAL assume true; 24125#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24123#func_to_recursive_line_27_to_27_0FINAL assume true; 24120#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24118#func_to_recursive_line_27_to_27_0FINAL assume true; 24117#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24113#func_to_recursive_line_27_to_27_0FINAL assume true; 24112#func_to_recursive_line_27_to_27_0EXIT >#69#return; 24100#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 24087#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24097#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 24093#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 24071#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24096#func_to_recursive_line_27_to_27_0FINAL assume true; 24084#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24085#func_to_recursive_line_27_to_27_0FINAL assume true; 24131#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24130#func_to_recursive_line_27_to_27_0FINAL assume true; 24128#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24126#func_to_recursive_line_27_to_27_0FINAL assume true; 24125#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24123#func_to_recursive_line_27_to_27_0FINAL assume true; 24120#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24118#func_to_recursive_line_27_to_27_0FINAL assume true; 24117#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24113#func_to_recursive_line_27_to_27_0FINAL assume true; 24112#func_to_recursive_line_27_to_27_0EXIT >#69#return; 24100#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 24087#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24097#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 24093#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 24086#func_to_recursive_line_26_to_27_0FINAL assume true; 24089#func_to_recursive_line_26_to_27_0EXIT >#67#return; 24092#func_to_recursive_line_26_to_27_0FINAL assume true; 24129#func_to_recursive_line_26_to_27_0EXIT >#67#return; 24127#func_to_recursive_line_26_to_27_0FINAL assume true; 24124#func_to_recursive_line_26_to_27_0EXIT >#67#return; 24122#func_to_recursive_line_26_to_27_0FINAL assume true; 24121#func_to_recursive_line_26_to_27_0EXIT >#67#return; 24119#func_to_recursive_line_26_to_27_0FINAL assume true; 24116#func_to_recursive_line_26_to_27_0EXIT >#67#return; 24115#func_to_recursive_line_26_to_27_0FINAL assume true; 24114#func_to_recursive_line_26_to_27_0EXIT >#63#return; 24091#L67 call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 24082#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 24094#func_to_recursive_line_25_to_26_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4); 24102#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4); 24088#L67-1 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24097#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 24093#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 24071#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24096#func_to_recursive_line_27_to_27_0FINAL assume true; 24084#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24085#func_to_recursive_line_27_to_27_0FINAL assume true; 24131#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24130#func_to_recursive_line_27_to_27_0FINAL assume true; 24128#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24126#func_to_recursive_line_27_to_27_0FINAL assume true; 24125#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24123#func_to_recursive_line_27_to_27_0FINAL assume true; 24120#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24118#func_to_recursive_line_27_to_27_0FINAL assume true; 24117#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24113#func_to_recursive_line_27_to_27_0FINAL assume true; 24112#func_to_recursive_line_27_to_27_0EXIT >#69#return; 24100#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 24087#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24097#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 24093#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 24071#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24096#func_to_recursive_line_27_to_27_0FINAL assume true; 24084#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24085#func_to_recursive_line_27_to_27_0FINAL assume true; 24131#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24130#func_to_recursive_line_27_to_27_0FINAL assume true; 24128#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24126#func_to_recursive_line_27_to_27_0FINAL assume true; 24125#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24123#func_to_recursive_line_27_to_27_0FINAL assume true; 24120#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24118#func_to_recursive_line_27_to_27_0FINAL assume true; 24117#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24113#func_to_recursive_line_27_to_27_0FINAL assume true; 24112#func_to_recursive_line_27_to_27_0EXIT >#69#return; 24100#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 24087#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24097#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 24093#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 24071#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24096#func_to_recursive_line_27_to_27_0FINAL assume true; 24084#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24085#func_to_recursive_line_27_to_27_0FINAL assume true; 24131#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24130#func_to_recursive_line_27_to_27_0FINAL assume true; 24128#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24126#func_to_recursive_line_27_to_27_0FINAL assume true; 24125#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24123#func_to_recursive_line_27_to_27_0FINAL assume true; 24120#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24118#func_to_recursive_line_27_to_27_0FINAL assume true; 24117#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24113#func_to_recursive_line_27_to_27_0FINAL assume true; 24112#func_to_recursive_line_27_to_27_0EXIT >#69#return; 24100#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 24087#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24097#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 24093#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 24071#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24096#func_to_recursive_line_27_to_27_0FINAL assume true; 24084#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24085#func_to_recursive_line_27_to_27_0FINAL assume true; 24131#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24130#func_to_recursive_line_27_to_27_0FINAL assume true; 24128#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24126#func_to_recursive_line_27_to_27_0FINAL assume true; 24125#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24123#func_to_recursive_line_27_to_27_0FINAL assume true; 24120#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24118#func_to_recursive_line_27_to_27_0FINAL assume true; 24117#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24113#func_to_recursive_line_27_to_27_0FINAL assume true; 24112#func_to_recursive_line_27_to_27_0EXIT >#69#return; 24100#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 24087#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24097#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 24093#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 24071#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24096#func_to_recursive_line_27_to_27_0FINAL assume true; 24084#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24085#func_to_recursive_line_27_to_27_0FINAL assume true; 24131#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24130#func_to_recursive_line_27_to_27_0FINAL assume true; 24128#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24126#func_to_recursive_line_27_to_27_0FINAL assume true; 24125#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24123#func_to_recursive_line_27_to_27_0FINAL assume true; 24120#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24118#func_to_recursive_line_27_to_27_0FINAL assume true; 24117#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24113#func_to_recursive_line_27_to_27_0FINAL assume true; 24112#func_to_recursive_line_27_to_27_0EXIT >#69#return; 24100#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 24087#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24097#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 24093#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 24086#func_to_recursive_line_26_to_27_0FINAL assume true; 24089#func_to_recursive_line_26_to_27_0EXIT >#67#return; 24092#func_to_recursive_line_26_to_27_0FINAL assume true; 24129#func_to_recursive_line_26_to_27_0EXIT >#67#return; 24127#func_to_recursive_line_26_to_27_0FINAL assume true; 24124#func_to_recursive_line_26_to_27_0EXIT >#67#return; 24122#func_to_recursive_line_26_to_27_0FINAL assume true; 24121#func_to_recursive_line_26_to_27_0EXIT >#67#return; 24119#func_to_recursive_line_26_to_27_0FINAL assume true; 24116#func_to_recursive_line_26_to_27_0EXIT >#67#return; 24115#func_to_recursive_line_26_to_27_0FINAL assume true; 24114#func_to_recursive_line_26_to_27_0EXIT >#63#return; 24091#L67 call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 24082#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 24094#func_to_recursive_line_25_to_26_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4); 24102#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 24090#func_to_recursive_line_25_to_26_0FINAL assume true; 24081#func_to_recursive_line_25_to_26_0EXIT >#61#return; 24083#func_to_recursive_line_25_to_26_0FINAL assume true; 24111#func_to_recursive_line_25_to_26_0EXIT >#61#return; 24107#func_to_recursive_line_25_to_26_0FINAL assume true; 24106#func_to_recursive_line_25_to_26_0EXIT >#59#return; 24101#L87 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 24075#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 24069#func_to_recursive_line_24_to_25_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 24074#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#2(0, ~c.base, ~c.offset, 4); 24076#L87-1 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 24094#func_to_recursive_line_25_to_26_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4); 24102#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4); 24088#L67-1 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24097#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 24093#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 24071#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24096#func_to_recursive_line_27_to_27_0FINAL assume true; 24084#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24085#func_to_recursive_line_27_to_27_0FINAL assume true; 24131#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24130#func_to_recursive_line_27_to_27_0FINAL assume true; 24128#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24126#func_to_recursive_line_27_to_27_0FINAL assume true; 24125#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24123#func_to_recursive_line_27_to_27_0FINAL assume true; 24120#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24118#func_to_recursive_line_27_to_27_0FINAL assume true; 24117#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24113#func_to_recursive_line_27_to_27_0FINAL assume true; 24112#func_to_recursive_line_27_to_27_0EXIT >#69#return; 24100#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 24087#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24097#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 24093#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 24071#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24096#func_to_recursive_line_27_to_27_0FINAL assume true; 24084#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24085#func_to_recursive_line_27_to_27_0FINAL assume true; 24131#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24130#func_to_recursive_line_27_to_27_0FINAL assume true; 24128#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24126#func_to_recursive_line_27_to_27_0FINAL assume true; 24125#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24123#func_to_recursive_line_27_to_27_0FINAL assume true; 24120#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24118#func_to_recursive_line_27_to_27_0FINAL assume true; 24117#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24113#func_to_recursive_line_27_to_27_0FINAL assume true; 24112#func_to_recursive_line_27_to_27_0EXIT >#69#return; 24100#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 24087#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24097#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 24093#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 24071#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24096#func_to_recursive_line_27_to_27_0FINAL assume true; 24084#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24085#func_to_recursive_line_27_to_27_0FINAL assume true; 24131#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24130#func_to_recursive_line_27_to_27_0FINAL assume true; 24128#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24126#func_to_recursive_line_27_to_27_0FINAL assume true; 24125#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24123#func_to_recursive_line_27_to_27_0FINAL assume true; 24120#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24118#func_to_recursive_line_27_to_27_0FINAL assume true; 24117#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24113#func_to_recursive_line_27_to_27_0FINAL assume true; 24112#func_to_recursive_line_27_to_27_0EXIT >#69#return; 24100#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 24087#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24097#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 24093#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 24071#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24096#func_to_recursive_line_27_to_27_0FINAL assume true; 24084#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24085#func_to_recursive_line_27_to_27_0FINAL assume true; 24131#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24130#func_to_recursive_line_27_to_27_0FINAL assume true; 24128#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24126#func_to_recursive_line_27_to_27_0FINAL assume true; 24125#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24123#func_to_recursive_line_27_to_27_0FINAL assume true; 24120#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24118#func_to_recursive_line_27_to_27_0FINAL assume true; 24117#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24113#func_to_recursive_line_27_to_27_0FINAL assume true; 24112#func_to_recursive_line_27_to_27_0EXIT >#69#return; 24100#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 24087#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24097#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 24093#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 24071#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24096#func_to_recursive_line_27_to_27_0FINAL assume true; 24084#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24085#func_to_recursive_line_27_to_27_0FINAL assume true; 24131#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24130#func_to_recursive_line_27_to_27_0FINAL assume true; 24128#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24126#func_to_recursive_line_27_to_27_0FINAL assume true; 24125#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24123#func_to_recursive_line_27_to_27_0FINAL assume true; 24120#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24118#func_to_recursive_line_27_to_27_0FINAL assume true; 24117#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24113#func_to_recursive_line_27_to_27_0FINAL assume true; 24112#func_to_recursive_line_27_to_27_0EXIT >#69#return; 24100#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 24087#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24097#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 24093#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 24086#func_to_recursive_line_26_to_27_0FINAL assume true; 24089#func_to_recursive_line_26_to_27_0EXIT >#67#return; 24092#func_to_recursive_line_26_to_27_0FINAL assume true; 24129#func_to_recursive_line_26_to_27_0EXIT >#67#return; 24127#func_to_recursive_line_26_to_27_0FINAL assume true; 24124#func_to_recursive_line_26_to_27_0EXIT >#67#return; 24122#func_to_recursive_line_26_to_27_0FINAL assume true; 24121#func_to_recursive_line_26_to_27_0EXIT >#67#return; 24119#func_to_recursive_line_26_to_27_0FINAL assume true; 24116#func_to_recursive_line_26_to_27_0EXIT >#67#return; 24115#func_to_recursive_line_26_to_27_0FINAL assume true; 24114#func_to_recursive_line_26_to_27_0EXIT >#63#return; 24091#L67 call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 24082#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 24094#func_to_recursive_line_25_to_26_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4); 24102#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#5(0, ~d.base, ~d.offset, 4); 24088#L67-1 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24097#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 24093#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 24071#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24096#func_to_recursive_line_27_to_27_0FINAL assume true; 24084#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24085#func_to_recursive_line_27_to_27_0FINAL assume true; 24131#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24130#func_to_recursive_line_27_to_27_0FINAL assume true; 24128#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24126#func_to_recursive_line_27_to_27_0FINAL assume true; 24125#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24123#func_to_recursive_line_27_to_27_0FINAL assume true; 24120#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24118#func_to_recursive_line_27_to_27_0FINAL assume true; 24117#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24113#func_to_recursive_line_27_to_27_0FINAL assume true; 24112#func_to_recursive_line_27_to_27_0EXIT >#69#return; 24100#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 24087#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24097#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 24093#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 24071#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24096#func_to_recursive_line_27_to_27_0FINAL assume true; 24084#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24085#func_to_recursive_line_27_to_27_0FINAL assume true; 24131#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24130#func_to_recursive_line_27_to_27_0FINAL assume true; 24128#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24126#func_to_recursive_line_27_to_27_0FINAL assume true; 24125#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24123#func_to_recursive_line_27_to_27_0FINAL assume true; 24120#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24118#func_to_recursive_line_27_to_27_0FINAL assume true; 24117#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24113#func_to_recursive_line_27_to_27_0FINAL assume true; 24112#func_to_recursive_line_27_to_27_0EXIT >#69#return; 24100#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 24087#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24097#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 24093#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 24071#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24096#func_to_recursive_line_27_to_27_0FINAL assume true; 24084#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24085#func_to_recursive_line_27_to_27_0FINAL assume true; 24131#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24130#func_to_recursive_line_27_to_27_0FINAL assume true; 24128#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24126#func_to_recursive_line_27_to_27_0FINAL assume true; 24125#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24123#func_to_recursive_line_27_to_27_0FINAL assume true; 24120#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24118#func_to_recursive_line_27_to_27_0FINAL assume true; 24117#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24113#func_to_recursive_line_27_to_27_0FINAL assume true; 24112#func_to_recursive_line_27_to_27_0EXIT >#69#return; 24100#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 24087#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24097#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 24093#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 24071#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24096#func_to_recursive_line_27_to_27_0FINAL assume true; 24084#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24085#func_to_recursive_line_27_to_27_0FINAL assume true; 24131#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24130#func_to_recursive_line_27_to_27_0FINAL assume true; 24128#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24126#func_to_recursive_line_27_to_27_0FINAL assume true; 24125#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24123#func_to_recursive_line_27_to_27_0FINAL assume true; 24120#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24118#func_to_recursive_line_27_to_27_0FINAL assume true; 24117#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24113#func_to_recursive_line_27_to_27_0FINAL assume true; 24112#func_to_recursive_line_27_to_27_0EXIT >#69#return; 24100#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 24087#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24097#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 24093#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 24071#L47-1 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24072#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24070#func_to_recursive_line_27_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 24073#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24096#func_to_recursive_line_27_to_27_0FINAL assume true; 24084#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24085#func_to_recursive_line_27_to_27_0FINAL assume true; 24131#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24130#func_to_recursive_line_27_to_27_0FINAL assume true; 24128#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24126#func_to_recursive_line_27_to_27_0FINAL assume true; 24125#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24123#func_to_recursive_line_27_to_27_0FINAL assume true; 24120#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24118#func_to_recursive_line_27_to_27_0FINAL assume true; 24117#func_to_recursive_line_27_to_27_0EXIT >#65#return; 24113#func_to_recursive_line_27_to_27_0FINAL assume true; 24112#func_to_recursive_line_27_to_27_0EXIT >#69#return; 24100#L47 call #t~mem8 := read~int#5(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#5(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 24087#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24097#func_to_recursive_line_26_to_27_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#5(~d.base, ~d.offset, 4); 24093#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 24086#func_to_recursive_line_26_to_27_0FINAL assume true; 24089#func_to_recursive_line_26_to_27_0EXIT >#67#return; 24092#func_to_recursive_line_26_to_27_0FINAL assume true; 24129#func_to_recursive_line_26_to_27_0EXIT >#67#return; 24127#func_to_recursive_line_26_to_27_0FINAL assume true; 24124#func_to_recursive_line_26_to_27_0EXIT >#67#return; 24122#func_to_recursive_line_26_to_27_0FINAL assume true; 24121#func_to_recursive_line_26_to_27_0EXIT >#67#return; 24119#func_to_recursive_line_26_to_27_0FINAL assume true; 24116#func_to_recursive_line_26_to_27_0EXIT >#67#return; 24115#func_to_recursive_line_26_to_27_0FINAL assume true; 24114#func_to_recursive_line_26_to_27_0EXIT >#63#return; 24091#L67 call #t~mem11 := read~int#2(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 24082#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 24094#func_to_recursive_line_25_to_26_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#2(~c.base, ~c.offset, 4); 24102#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 24090#func_to_recursive_line_25_to_26_0FINAL assume true; 24081#func_to_recursive_line_25_to_26_0EXIT >#61#return; 24083#func_to_recursive_line_25_to_26_0FINAL assume true; 24111#func_to_recursive_line_25_to_26_0EXIT >#61#return; 24107#func_to_recursive_line_25_to_26_0FINAL assume true; 24106#func_to_recursive_line_25_to_26_0EXIT >#59#return; 24101#L87 call #t~mem14 := read~int#3(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#3(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 24075#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 24069#func_to_recursive_line_24_to_25_0ENTRY ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#3(~b.base, ~b.offset, 4); 24074#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 24077#func_to_recursive_line_24_to_25_0FINAL assume true; 24080#func_to_recursive_line_24_to_25_0EXIT >#57#return; 24103#func_to_recursive_line_24_to_25_0FINAL assume true; 24110#func_to_recursive_line_24_to_25_0EXIT >#57#return; 24109#func_to_recursive_line_24_to_25_0FINAL assume true; 24108#func_to_recursive_line_24_to_25_0EXIT >#57#return; 24105#func_to_recursive_line_24_to_25_0FINAL assume true; 24104#func_to_recursive_line_24_to_25_0EXIT >#73#return; 24078#L107 call #t~mem17 := read~int#1(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#1(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 24067#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 24095#func_to_recursive_line_23_to_24_0ENTRY [2024-11-10 23:19:49,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:19:49,857 INFO L85 PathProgramCache]: Analyzing trace with hash 83402, now seen corresponding path program 11 times [2024-11-10 23:19:49,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:19:49,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892442561] [2024-11-10 23:19:49,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:19:49,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:19:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:19:49,870 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:19:49,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:19:49,882 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:19:49,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:19:49,882 INFO L85 PathProgramCache]: Analyzing trace with hash 579422803, now seen corresponding path program 7 times [2024-11-10 23:19:49,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:19:49,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698520451] [2024-11-10 23:19:49,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:19:49,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:19:50,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:56,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:57,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:04,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:04,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:06,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:06,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:07,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:07,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:07,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:07,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:07,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:07,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:07,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:07,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:07,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:07,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:07,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:07,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:20:07,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:20:08,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:20:08,498 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,706 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,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:20:08,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:20:08,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-11-10 23:20:08,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:08,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:20:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:20:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:20:09,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:20:09,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:20:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-11-10 23:20:09,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 440 [2024-11-10 23:20:09,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:20:09,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:20:09,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:20:09,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:20:09,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:20:09,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-11-10 23:20:09,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:09,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:20:10,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:20:10,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:20:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:20:10,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:20:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-11-10 23:20:10,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 440 [2024-11-10 23:20:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:20:10,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:20:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:20:10,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:20:10,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:20:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-11-10 23:20:10,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:10,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:20:11,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:20:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:20:11,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:20:11,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:20:11,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 23:20:11,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-11-10 23:20:11,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 440 [2024-11-10 23:20:11,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:20:11,307 INFO L134 CoverageAnalysis]: Checked inductivity of 107937 backedges. 26 proven. 981 refuted. 0 times theorem prover too weak. 106930 trivial. 0 not checked. [2024-11-10 23:20:11,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:20:11,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698520451] [2024-11-10 23:20:11,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698520451] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 23:20:11,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650989891] [2024-11-10 23:20:11,308 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-10 23:20:11,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 23:20:11,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:20:11,310 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:20:11,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process