./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 8be7027f 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-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 21:44:11,096 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 21:44:11,161 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-12 21:44:11,168 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 21:44:11,169 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 21:44:11,200 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 21:44:11,207 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 21:44:11,207 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 21:44:11,207 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 21:44:11,207 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 21:44:11,208 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 21:44:11,208 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 21:44:11,208 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 21:44:11,208 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-12 21:44:11,209 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-12 21:44:11,209 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-12 21:44:11,209 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-12 21:44:11,209 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-12 21:44:11,209 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-12 21:44:11,210 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 21:44:11,210 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-12 21:44:11,217 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 21:44:11,217 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 21:44:11,218 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 21:44:11,218 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 21:44:11,218 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-12 21:44:11,218 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-12 21:44:11,218 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-12 21:44:11,219 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 21:44:11,219 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 21:44:11,219 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 21:44:11,219 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 21:44:11,219 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-12 21:44:11,219 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 21:44:11,220 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 21:44:11,220 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 21:44:11,220 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 21:44:11,220 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 21:44:11,220 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-12 21:44:11,221 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-12 21:44:11,625 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 21:44:11,647 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 21:44:11,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 21:44:11,652 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 21:44:11,652 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 21:44:11,653 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-12 21:44:13,007 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 21:44:13,196 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 21:44:13,196 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2024-11-12 21:44:13,202 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78ae5fb2a/579b09f70f814db28cbfe142ec3098cf/FLAG4096776fd [2024-11-12 21:44:13,217 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78ae5fb2a/579b09f70f814db28cbfe142ec3098cf [2024-11-12 21:44:13,219 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 21:44:13,220 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 21:44:13,221 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 21:44:13,221 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 21:44:13,229 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 21:44:13,229 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 09:44:13" (1/1) ... [2024-11-12 21:44:13,232 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7618a49b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:13, skipping insertion in model container [2024-11-12 21:44:13,232 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 09:44:13" (1/1) ... [2024-11-12 21:44:13,264 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 21:44:13,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 21:44:13,449 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 21:44:13,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 21:44:13,482 INFO L204 MainTranslator]: Completed translation [2024-11-12 21:44:13,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:13 WrapperNode [2024-11-12 21:44:13,483 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 21:44:13,483 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 21:44:13,484 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 21:44:13,484 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 21:44:13,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:13" (1/1) ... [2024-11-12 21:44:13,495 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:13" (1/1) ... [2024-11-12 21:44:13,508 INFO L138 Inliner]: procedures = 16, calls = 63, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2024-11-12 21:44:13,508 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 21:44:13,509 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 21:44:13,509 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 21:44:13,509 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 21:44:13,516 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:13" (1/1) ... [2024-11-12 21:44:13,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:13" (1/1) ... [2024-11-12 21:44:13,518 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:13" (1/1) ... [2024-11-12 21:44:13,534 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-12 21:44:13,534 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:13" (1/1) ... [2024-11-12 21:44:13,534 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:13" (1/1) ... [2024-11-12 21:44:13,541 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:13" (1/1) ... [2024-11-12 21:44:13,543 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:13" (1/1) ... [2024-11-12 21:44:13,548 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:13" (1/1) ... [2024-11-12 21:44:13,549 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:13" (1/1) ... [2024-11-12 21:44:13,551 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 21:44:13,552 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 21:44:13,552 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 21:44:13,552 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 21:44:13,553 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:13" (1/1) ... [2024-11-12 21:44:13,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-12 21:44:13,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:44:13,597 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-12 21:44:13,606 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-12 21:44:13,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 21:44:13,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 21:44:13,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 21:44:13,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-12 21:44:13,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-12 21:44:13,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-12 21:44:13,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-12 21:44:13,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 21:44:13,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 21:44:13,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 21:44:13,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-12 21:44:13,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-12 21:44:13,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-12 21:44:13,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-12 21:44:13,642 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2024-11-12 21:44:13,642 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2024-11-12 21:44:13,642 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2024-11-12 21:44:13,642 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2024-11-12 21:44:13,642 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_26_0 [2024-11-12 21:44:13,642 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_26_0 [2024-11-12 21:44:13,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 21:44:13,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 21:44:13,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 21:44:13,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 21:44:13,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-12 21:44:13,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-12 21:44:13,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-12 21:44:13,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-12 21:44:13,644 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_27_0 [2024-11-12 21:44:13,644 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_27_0 [2024-11-12 21:44:13,645 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_27_0 [2024-11-12 21:44:13,645 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_27_0 [2024-11-12 21:44:13,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 21:44:13,725 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 21:44:13,727 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 21:44:13,934 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-12 21:44:13,935 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 21:44:13,944 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 21:44:13,944 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-12 21:44:13,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 09:44:13 BoogieIcfgContainer [2024-11-12 21:44:13,945 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 21:44:13,945 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-12 21:44:13,945 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-12 21:44:13,948 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-12 21:44:13,949 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 21:44:13,949 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.11 09:44:13" (1/3) ... [2024-11-12 21:44:13,950 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1cbd4a82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 09:44:13, skipping insertion in model container [2024-11-12 21:44:13,950 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 21:44:13,950 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:44:13" (2/3) ... [2024-11-12 21:44:13,950 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1cbd4a82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 09:44:13, skipping insertion in model container [2024-11-12 21:44:13,950 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-12 21:44:13,950 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 09:44:13" (3/3) ... [2024-11-12 21:44:13,951 INFO L332 chiAutomizerObserver]: Analyzing ICFG recursified_nested_5.c [2024-11-12 21:44:13,994 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2024-11-12 21:44:13,994 INFO L302 stractBuchiCegarLoop]: Hoare is None [2024-11-12 21:44:13,994 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-12 21:44:13,994 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-12 21:44:13,994 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-12 21:44:13,995 INFO L306 stractBuchiCegarLoop]: Difference is false [2024-11-12 21:44:13,995 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-12 21:44:13,995 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-12 21:44:13,998 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-12 21:44:14,014 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-12 21:44:14,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:44:14,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:44:14,019 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-12 21:44:14,019 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:44:14,019 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-12 21:44:14,020 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-12 21:44:14,022 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-12 21:44:14,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:44:14,023 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:44:14,023 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-12 21:44:14,023 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:44:14,028 INFO L747 eck$LassoCheckResult]: Stem: "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);" "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#4(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "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);"< [2024-11-12 21:44:14,029 INFO L749 eck$LassoCheckResult]: Loop: "~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);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(0, ~b.base, ~b.offset, 4);" "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);"< "~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#4(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#112#return;" "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;" "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);"< [2024-11-12 21:44:14,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:14,033 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 1 times [2024-11-12 21:44:14,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:14,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086948397] [2024-11-12 21:44:14,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:14,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:14,155 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:44:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:14,193 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:44:14,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:14,195 INFO L85 PathProgramCache]: Analyzing trace with hash 2053320187, now seen corresponding path program 1 times [2024-11-12 21:44:14,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:14,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66501778] [2024-11-12 21:44:14,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:14,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:14,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:14,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:14,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:44:14,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66501778] [2024-11-12 21:44:14,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66501778] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:44:14,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79413184] [2024-11-12 21:44:14,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:14,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:44:14,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:44:14,645 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-12 21:44:14,648 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-12 21:44:14,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:14,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-12 21:44:14,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:44:14,795 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-12 21:44:14,870 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:44:15,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79413184] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:44:15,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:44:15,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-11-12 21:44:15,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708044160] [2024-11-12 21:44:15,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:44:15,018 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 21:44:15,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:44:15,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 21:44:15,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-12 21:44:15,051 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 14 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 4 states have call successors, (4), 4 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-12 21:44:15,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:44:15,474 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2024-11-12 21:44:15,475 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 76 transitions. [2024-11-12 21:44:15,478 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-12 21:44:15,482 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 42 states and 53 transitions. [2024-11-12 21:44:15,483 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-12 21:44:15,483 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-12 21:44:15,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 53 transitions. [2024-11-12 21:44:15,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:44:15,485 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 53 transitions. [2024-11-12 21:44:15,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 53 transitions. [2024-11-12 21:44:15,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2024-11-12 21:44:15,503 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-12 21:44:15,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2024-11-12 21:44:15,505 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-11-12 21:44:15,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 21:44:15,509 INFO L426 stractBuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-11-12 21:44:15,509 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-12 21:44:15,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 44 transitions. [2024-11-12 21:44:15,510 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-12 21:44:15,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:44:15,510 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:44:15,511 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-12 21:44:15,511 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-12 21:44:15,511 INFO L747 eck$LassoCheckResult]: Stem: "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);" "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#4(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "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);"< [2024-11-12 21:44:15,511 INFO L749 eck$LassoCheckResult]: Loop: "~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);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(0, ~b.base, ~b.offset, 4);" "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);"< "~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#4(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#5(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#5(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#98#return;" "call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#100#return;" "assume true;" >"#112#return;" "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;" "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);"< [2024-11-12 21:44:15,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:15,512 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 2 times [2024-11-12 21:44:15,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:15,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722323748] [2024-11-12 21:44:15,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:15,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:15,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:15,534 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:44:15,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:15,546 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:44:15,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:15,547 INFO L85 PathProgramCache]: Analyzing trace with hash 54735792, now seen corresponding path program 1 times [2024-11-12 21:44:15,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:15,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2278511] [2024-11-12 21:44:15,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:15,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:15,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:15,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:15,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:15,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:15,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:15,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 21:44:15,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:15,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:44:15,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2278511] [2024-11-12 21:44:15,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2278511] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:44:15,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399261047] [2024-11-12 21:44:15,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:15,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:44:15,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:44:15,750 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-12 21:44:15,751 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-12 21:44:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:15,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-12 21:44:15,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:44:15,842 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-12 21:44:15,959 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:44:16,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399261047] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:44:16,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:44:16,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2024-11-12 21:44:16,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356835809] [2024-11-12 21:44:16,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:44:16,138 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 21:44:16,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:44:16,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 21:44:16,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-12 21:44:16,143 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. cyclomatic complexity: 13 Second operand has 14 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (6), 1 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-12 21:44:16,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:44:16,422 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2024-11-12 21:44:16,423 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 52 transitions. [2024-11-12 21:44:16,424 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-12 21:44:16,427 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 52 transitions. [2024-11-12 21:44:16,429 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-12 21:44:16,429 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-12 21:44:16,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 52 transitions. [2024-11-12 21:44:16,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:44:16,430 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 52 transitions. [2024-11-12 21:44:16,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 52 transitions. [2024-11-12 21:44:16,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2024-11-12 21:44:16,433 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-12 21:44:16,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2024-11-12 21:44:16,435 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 46 transitions. [2024-11-12 21:44:16,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 21:44:16,437 INFO L426 stractBuchiCegarLoop]: Abstraction has 38 states and 46 transitions. [2024-11-12 21:44:16,437 INFO L333 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-12 21:44:16,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 46 transitions. [2024-11-12 21:44:16,438 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-12 21:44:16,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:44:16,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:44:16,440 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-12 21:44:16,440 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-12 21:44:16,441 INFO L747 eck$LassoCheckResult]: Stem: "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);" "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#4(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "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);"< [2024-11-12 21:44:16,441 INFO L749 eck$LassoCheckResult]: Loop: "~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);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(0, ~b.base, ~b.offset, 4);" "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);"< "~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#4(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#5(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#5(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#5(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#104#return;" "assume true;" >"#98#return;" "call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#100#return;" "assume true;" >"#112#return;" "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;" "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);"< [2024-11-12 21:44:16,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:16,441 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 3 times [2024-11-12 21:44:16,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:16,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932237552] [2024-11-12 21:44:16,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:16,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:16,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:16,463 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:44:16,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:16,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:44:16,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:16,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1525796123, now seen corresponding path program 1 times [2024-11-12 21:44:16,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:16,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740259591] [2024-11-12 21:44:16,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:16,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:16,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:16,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:16,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:16,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:16,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:16,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:16,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 21:44:16,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:16,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-12 21:44:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:16,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:44:16,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740259591] [2024-11-12 21:44:16,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740259591] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:44:16,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082882997] [2024-11-12 21:44:16,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:16,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:44:16,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:44:16,862 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-12 21:44:16,863 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-12 21:44:16,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:16,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-12 21:44:16,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:44:16,957 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-12 21:44:17,114 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:44:17,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082882997] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:44:17,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:44:17,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 10] total 23 [2024-11-12 21:44:17,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095051001] [2024-11-12 21:44:17,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:44:17,717 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 21:44:17,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:44:17,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-12 21:44:17,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2024-11-12 21:44:17,718 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. cyclomatic complexity: 13 Second operand has 23 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 9 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (12), 5 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-12 21:44:18,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:44:18,375 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2024-11-12 21:44:18,391 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 53 transitions. [2024-11-12 21:44:18,392 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-12 21:44:18,393 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 53 transitions. [2024-11-12 21:44:18,393 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2024-11-12 21:44:18,394 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2024-11-12 21:44:18,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 53 transitions. [2024-11-12 21:44:18,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:44:18,394 INFO L218 hiAutomatonCegarLoop]: Abstraction has 44 states and 53 transitions. [2024-11-12 21:44:18,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 53 transitions. [2024-11-12 21:44:18,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2024-11-12 21:44:18,405 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), 9 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-12 21:44:18,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2024-11-12 21:44:18,406 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 50 transitions. [2024-11-12 21:44:18,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 21:44:18,407 INFO L426 stractBuchiCegarLoop]: Abstraction has 42 states and 50 transitions. [2024-11-12 21:44:18,407 INFO L333 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-12 21:44:18,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 50 transitions. [2024-11-12 21:44:18,408 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-12 21:44:18,408 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:44:18,408 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:44:18,409 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-12 21:44:18,409 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:44:18,409 INFO L747 eck$LassoCheckResult]: Stem: "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);" "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#4(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "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);"< [2024-11-12 21:44:18,410 INFO L749 eck$LassoCheckResult]: Loop: "~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);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(0, ~b.base, ~b.offset, 4);" "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);"< "~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#4(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#5(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#5(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#5(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#5(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#104#return;" "assume true;" >"#104#return;" "assume true;" >"#98#return;" "call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#100#return;" "assume true;" >"#112#return;" "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;" "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);"< [2024-11-12 21:44:18,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:18,414 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 4 times [2024-11-12 21:44:18,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:18,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821413460] [2024-11-12 21:44:18,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:18,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:18,436 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:44:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:18,446 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:44:18,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:18,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1237166494, now seen corresponding path program 1 times [2024-11-12 21:44:18,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:18,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428443681] [2024-11-12 21:44:18,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:18,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:18,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:18,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:18,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:18,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:19,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:19,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:19,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:19,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:19,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 21:44:19,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:19,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-12 21:44:19,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:19,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:19,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:19,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:19,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 21:44:19,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:19,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-12 21:44:19,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:19,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-12 21:44:19,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:19,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:44:19,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428443681] [2024-11-12 21:44:19,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428443681] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:44:19,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041274091] [2024-11-12 21:44:19,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:19,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:44:19,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:44:19,260 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-12 21:44:19,266 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-12 21:44:19,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:19,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-12 21:44:19,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:44:19,535 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-12 21:44:19,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:44:20,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041274091] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:44:20,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:44:20,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 10] total 26 [2024-11-12 21:44:20,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494508822] [2024-11-12 21:44:20,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:44:20,381 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 21:44:20,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:44:20,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-12 21:44:20,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2024-11-12 21:44:20,382 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. cyclomatic complexity: 13 Second operand has 26 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 19 states have internal predecessors, (59), 11 states have call successors, (30), 9 states have call predecessors, (30), 7 states have return successors, (23), 7 states have call predecessors, (23), 11 states have call successors, (23) [2024-11-12 21:44:20,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:44:20,802 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2024-11-12 21:44:20,802 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 54 transitions. [2024-11-12 21:44:20,803 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-12 21:44:20,804 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 54 transitions. [2024-11-12 21:44:20,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2024-11-12 21:44:20,804 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2024-11-12 21:44:20,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 54 transitions. [2024-11-12 21:44:20,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:44:20,805 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-11-12 21:44:20,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 54 transitions. [2024-11-12 21:44:20,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-12 21:44:20,807 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-12 21:44:20,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2024-11-12 21:44:20,808 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-11-12 21:44:20,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-12 21:44:20,809 INFO L426 stractBuchiCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-11-12 21:44:20,809 INFO L333 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-12 21:44:20,809 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 54 transitions. [2024-11-12 21:44:20,810 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-12 21:44:20,810 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:44:20,810 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:44:20,812 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-12 21:44:20,812 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-12 21:44:20,812 INFO L747 eck$LassoCheckResult]: Stem: "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);" "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#4(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "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);"< [2024-11-12 21:44:20,812 INFO L749 eck$LassoCheckResult]: Loop: "~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);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(0, ~b.base, ~b.offset, 4);" "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);"< "~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#4(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#5(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#5(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#5(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#5(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#104#return;" "assume true;" >"#104#return;" "assume true;" >"#98#return;" "call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#100#return;" "assume true;" >"#112#return;" "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;" "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);"< [2024-11-12 21:44:20,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:20,813 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 5 times [2024-11-12 21:44:20,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:20,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114639330] [2024-11-12 21:44:20,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:20,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:20,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:20,822 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:44:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:20,833 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:44:20,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:20,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1187443626, now seen corresponding path program 1 times [2024-11-12 21:44:20,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:20,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593688036] [2024-11-12 21:44:20,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:20,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:20,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:21,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:21,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:21,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:21,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:21,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:21,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:21,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:21,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:21,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:21,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:22,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 21:44:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:22,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:22,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:22,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:22,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:22,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 21:44:22,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:22,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-12 21:44:22,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:22,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:22,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:22,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:22,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:22,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 21:44:22,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:22,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:22,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:22,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:22,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 21:44:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:22,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-12 21:44:22,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:22,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 21:44:22,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:22,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:44:22,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593688036] [2024-11-12 21:44:22,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593688036] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:44:22,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355882091] [2024-11-12 21:44:22,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:22,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:44:22,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:44:22,109 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-12 21:44:22,110 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-12 21:44:22,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:22,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-12 21:44:22,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:44:22,333 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-12 21:44:22,595 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:44:23,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355882091] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:44:23,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:44:23,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 10] total 28 [2024-11-12 21:44:23,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139117717] [2024-11-12 21:44:23,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:44:23,759 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 21:44:23,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:44:23,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-12 21:44:23,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2024-11-12 21:44:23,760 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. cyclomatic complexity: 13 Second operand has 28 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 10 states have call successors, (35), 8 states have call predecessors, (35), 7 states have return successors, (25), 5 states have call predecessors, (25), 10 states have call successors, (25) [2024-11-12 21:44:24,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:44:24,216 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2024-11-12 21:44:24,216 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 58 transitions. [2024-11-12 21:44:24,217 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-12 21:44:24,217 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 58 transitions. [2024-11-12 21:44:24,218 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2024-11-12 21:44:24,218 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2024-11-12 21:44:24,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 58 transitions. [2024-11-12 21:44:24,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:44:24,218 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 58 transitions. [2024-11-12 21:44:24,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 58 transitions. [2024-11-12 21:44:24,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-12 21:44:24,221 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-12 21:44:24,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2024-11-12 21:44:24,221 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 58 transitions. [2024-11-12 21:44:24,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-12 21:44:24,222 INFO L426 stractBuchiCegarLoop]: Abstraction has 50 states and 58 transitions. [2024-11-12 21:44:24,222 INFO L333 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-12 21:44:24,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 58 transitions. [2024-11-12 21:44:24,222 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-12 21:44:24,222 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:44:24,222 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:44:24,224 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-12 21:44:24,224 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-12 21:44:24,224 INFO L747 eck$LassoCheckResult]: Stem: "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);" "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#4(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "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);"< [2024-11-12 21:44:24,225 INFO L749 eck$LassoCheckResult]: Loop: "~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);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(0, ~b.base, ~b.offset, 4);" "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);"< "~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#4(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#5(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#5(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#5(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#5(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#104#return;" "assume true;" >"#104#return;" "assume true;" >"#98#return;" "call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#100#return;" "assume true;" >"#112#return;" "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;" "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);"< [2024-11-12 21:44:24,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:24,225 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 6 times [2024-11-12 21:44:24,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:24,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077770209] [2024-11-12 21:44:24,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:24,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:24,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:24,234 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:44:24,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:24,239 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:44:24,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:24,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1835537834, now seen corresponding path program 2 times [2024-11-12 21:44:24,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:24,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317384333] [2024-11-12 21:44:24,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:24,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:24,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:24,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:25,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:25,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:26,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:26,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:26,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:26,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:26,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:26,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:26,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:26,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:26,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 21:44:26,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:26,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:26,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:26,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:26,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:26,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:26,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:26,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:26,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 21:44:26,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:26,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 21:44:26,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:26,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:26,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:26,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:26,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:26,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:26,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:26,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:26,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:26,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:26,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 21:44:26,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:26,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:26,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:26,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:26,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:26,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:26,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:26,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:26,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 21:44:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:26,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 21:44:26,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:26,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 21:44:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:26,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:44:26,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317384333] [2024-11-12 21:44:26,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317384333] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:44:26,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894227562] [2024-11-12 21:44:26,880 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 21:44:26,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:44:26,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:44:26,885 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-12 21:44:26,889 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-12 21:44:26,993 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 21:44:26,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 21:44:26,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2024-11-12 21:44:26,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327556301] [2024-11-12 21:44:26,994 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 21:44:26,994 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 21:44:26,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:44:26,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 21:44:26,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2024-11-12 21:44:26,995 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. cyclomatic complexity: 13 Second operand has 16 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 5 states have call successors, (14), 5 states have call predecessors, (14), 6 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2024-11-12 21:44:27,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:44:27,187 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2024-11-12 21:44:27,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 60 transitions. [2024-11-12 21:44:27,188 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-12 21:44:27,189 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 52 states and 60 transitions. [2024-11-12 21:44:27,189 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2024-11-12 21:44:27,189 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2024-11-12 21:44:27,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 60 transitions. [2024-11-12 21:44:27,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:44:27,190 INFO L218 hiAutomatonCegarLoop]: Abstraction has 52 states and 60 transitions. [2024-11-12 21:44:27,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 60 transitions. [2024-11-12 21:44:27,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-12 21:44:27,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 33 states have internal predecessors, (33), 10 states have call successors, (10), 5 states have call predecessors, (10), 13 states have return successors, (17), 13 states have call predecessors, (17), 8 states have call successors, (17) [2024-11-12 21:44:27,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2024-11-12 21:44:27,193 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 60 transitions. [2024-11-12 21:44:27,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 21:44:27,194 INFO L426 stractBuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2024-11-12 21:44:27,194 INFO L333 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-12 21:44:27,194 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 60 transitions. [2024-11-12 21:44:27,195 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-12 21:44:27,195 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:44:27,195 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:44:27,196 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-12 21:44:27,197 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [20, 20, 16, 16, 16, 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-12 21:44:27,197 INFO L747 eck$LassoCheckResult]: Stem: "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);" "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#4(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "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);"< [2024-11-12 21:44:27,197 INFO L749 eck$LassoCheckResult]: Loop: "~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);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(0, ~b.base, ~b.offset, 4);" "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);"< "~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#4(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#5(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#5(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#5(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#5(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#104#return;" "assume true;" >"#104#return;" "assume true;" >"#98#return;" "call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#100#return;" "assume true;" >"#112#return;" "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;" "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);"< [2024-11-12 21:44:27,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:27,197 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 7 times [2024-11-12 21:44:27,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:27,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080208129] [2024-11-12 21:44:27,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:27,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:27,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:27,206 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:44:27,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:27,211 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:44:27,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:27,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1067872234, now seen corresponding path program 3 times [2024-11-12 21:44:27,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:27,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579779205] [2024-11-12 21:44:27,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:27,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:27,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:28,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:28,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:29,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:29,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:29,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:29,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:30,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:30,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:30,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:30,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:30,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:30,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:30,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:30,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:30,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 21:44:30,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:30,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:30,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:30,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:30,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:30,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:30,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:30,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:30,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 21:44:30,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:30,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 21:44:30,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:30,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:30,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:30,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:30,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:30,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:30,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:30,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:30,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:30,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 21:44:30,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:30,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:30,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:30,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:30,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:30,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:30,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:30,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:30,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 21:44:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:30,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 21:44:30,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:30,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 21:44:30,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:30,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:44:30,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579779205] [2024-11-12 21:44:30,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579779205] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:44:30,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691332395] [2024-11-12 21:44:30,538 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 21:44:30,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:44:30,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:44:30,541 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-12 21:44:30,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-12 21:44:30,671 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 21:44:30,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 21:44:30,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2024-11-12 21:44:30,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812877599] [2024-11-12 21:44:30,672 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 21:44:30,672 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 21:44:30,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:44:30,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-12 21:44:30,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-11-12 21:44:30,674 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. cyclomatic complexity: 13 Second operand has 17 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 13 states have internal predecessors, (39), 5 states have call successors, (14), 5 states have call predecessors, (14), 7 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2024-11-12 21:44:30,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:44:30,916 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2024-11-12 21:44:30,916 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 62 transitions. [2024-11-12 21:44:30,918 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-12 21:44:30,919 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 62 transitions. [2024-11-12 21:44:30,919 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2024-11-12 21:44:30,919 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2024-11-12 21:44:30,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 62 transitions. [2024-11-12 21:44:30,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:44:30,919 INFO L218 hiAutomatonCegarLoop]: Abstraction has 54 states and 62 transitions. [2024-11-12 21:44:30,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 62 transitions. [2024-11-12 21:44:30,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-12 21:44:30,926 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-12 21:44:30,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2024-11-12 21:44:30,926 INFO L240 hiAutomatonCegarLoop]: Abstraction has 54 states and 62 transitions. [2024-11-12 21:44:30,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 21:44:30,929 INFO L426 stractBuchiCegarLoop]: Abstraction has 54 states and 62 transitions. [2024-11-12 21:44:30,929 INFO L333 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-12 21:44:30,929 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 62 transitions. [2024-11-12 21:44:30,930 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-12 21:44:30,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:44:30,930 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:44:30,933 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-12 21:44:30,933 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [24, 24, 20, 20, 20, 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-12 21:44:30,933 INFO L747 eck$LassoCheckResult]: Stem: "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);" "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#4(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "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);"< [2024-11-12 21:44:30,937 INFO L749 eck$LassoCheckResult]: Loop: "~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);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(0, ~b.base, ~b.offset, 4);" "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);"< "~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#4(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#5(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#5(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#5(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#5(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#104#return;" "assume true;" >"#104#return;" "assume true;" >"#98#return;" "call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#100#return;" "assume true;" >"#112#return;" "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;" "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);"< [2024-11-12 21:44:30,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:30,938 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 8 times [2024-11-12 21:44:30,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:30,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547494565] [2024-11-12 21:44:30,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:30,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:30,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:30,948 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:44:30,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:30,960 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:44:30,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:30,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1177257898, now seen corresponding path program 4 times [2024-11-12 21:44:30,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:30,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879365797] [2024-11-12 21:44:30,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:30,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:31,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:31,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:32,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:33,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:33,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:33,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:33,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:34,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:34,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:34,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:34,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:34,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:34,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:34,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:34,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:34,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:34,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 21:44:34,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:34,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:34,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:34,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:34,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:34,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:34,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:34,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:34,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:34,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:34,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:34,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 21:44:34,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:34,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 21:44:34,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:34,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:34,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:34,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:34,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:34,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:34,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:34,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:34,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:34,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:34,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:34,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:34,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:34,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:34,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:34,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 21:44:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:34,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:34,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:34,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:34,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:34,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:34,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:34,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:34,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:34,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:34,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:34,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:34,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 21:44:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:34,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 21:44:34,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:34,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-12 21:44:34,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:34,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:44:34,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879365797] [2024-11-12 21:44:34,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879365797] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:44:34,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865706854] [2024-11-12 21:44:34,621 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-12 21:44:34,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:44:34,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:44:34,624 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:44:34,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-12 21:44:34,771 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 21:44:34,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 21:44:34,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2024-11-12 21:44:34,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734550851] [2024-11-12 21:44:34,771 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 21:44:34,772 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 21:44:34,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:44:34,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-12 21:44:34,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-12 21:44:34,772 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. cyclomatic complexity: 13 Second operand has 18 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 5 states have call successors, (14), 5 states have call predecessors, (14), 8 states have return successors, (17), 7 states have call predecessors, (17), 5 states have call successors, (17) [2024-11-12 21:44:35,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:44:35,014 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2024-11-12 21:44:35,015 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 64 transitions. [2024-11-12 21:44:35,015 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-12 21:44:35,016 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 56 states and 64 transitions. [2024-11-12 21:44:35,016 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2024-11-12 21:44:35,016 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2024-11-12 21:44:35,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 64 transitions. [2024-11-12 21:44:35,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:44:35,017 INFO L218 hiAutomatonCegarLoop]: Abstraction has 56 states and 64 transitions. [2024-11-12 21:44:35,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 64 transitions. [2024-11-12 21:44:35,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-12 21:44:35,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 35 states have internal predecessors, (35), 10 states have call successors, (10), 5 states have call predecessors, (10), 15 states have return successors, (19), 15 states have call predecessors, (19), 8 states have call successors, (19) [2024-11-12 21:44:35,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2024-11-12 21:44:35,020 INFO L240 hiAutomatonCegarLoop]: Abstraction has 56 states and 64 transitions. [2024-11-12 21:44:35,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 21:44:35,020 INFO L426 stractBuchiCegarLoop]: Abstraction has 56 states and 64 transitions. [2024-11-12 21:44:35,020 INFO L333 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-12 21:44:35,021 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 64 transitions. [2024-11-12 21:44:35,021 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-12 21:44:35,021 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:44:35,021 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:44:35,023 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-12 21:44:35,023 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [28, 28, 24, 24, 24, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:44:35,023 INFO L747 eck$LassoCheckResult]: Stem: "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);" "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#4(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "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);"< [2024-11-12 21:44:35,023 INFO L749 eck$LassoCheckResult]: Loop: "~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);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(0, ~b.base, ~b.offset, 4);" "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);"< "~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#4(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#5(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#5(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#5(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#5(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#104#return;" "assume true;" >"#104#return;" "assume true;" >"#98#return;" "call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#100#return;" "assume true;" >"#112#return;" "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;" "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);"< [2024-11-12 21:44:35,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:35,023 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 9 times [2024-11-12 21:44:35,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:35,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155047994] [2024-11-12 21:44:35,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:35,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:35,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:35,031 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:44:35,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:35,036 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:44:35,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:35,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1094796010, now seen corresponding path program 5 times [2024-11-12 21:44:35,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:35,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097439196] [2024-11-12 21:44:35,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:35,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:35,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:35,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:36,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:36,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:36,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:37,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:37,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:37,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:37,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:37,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:37,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:37,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:37,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:37,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:37,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:37,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:37,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:44:37,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:37,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:37,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:37,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:37,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:37,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:37,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:37,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:37,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:37,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:37,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:37,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:37,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:44:37,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:37,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 21:44:37,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:37,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:37,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:37,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:37,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:37,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:37,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:37,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:37,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:37,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:37,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:37,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:37,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:37,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:37,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:37,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:44:37,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:37,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:37,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:37,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:37,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:37,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:37,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:37,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:37,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:37,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:37,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:37,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:37,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:37,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:44:37,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:37,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 21:44:37,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:37,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-12 21:44:37,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:37,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:44:37,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097439196] [2024-11-12 21:44:37,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097439196] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:44:37,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351915761] [2024-11-12 21:44:37,374 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-12 21:44:37,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:44:37,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:44:37,376 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:44:37,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-12 21:44:37,546 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 21:44:37,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 21:44:37,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2024-11-12 21:44:37,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004175342] [2024-11-12 21:44:37,546 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 21:44:37,547 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 21:44:37,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:44:37,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-12 21:44:37,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-11-12 21:44:37,548 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. cyclomatic complexity: 13 Second operand has 17 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 7 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2024-11-12 21:44:37,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:44:37,772 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2024-11-12 21:44:37,773 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 66 transitions. [2024-11-12 21:44:37,773 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-12 21:44:37,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 66 transitions. [2024-11-12 21:44:37,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2024-11-12 21:44:37,774 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2024-11-12 21:44:37,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 66 transitions. [2024-11-12 21:44:37,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:44:37,775 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 66 transitions. [2024-11-12 21:44:37,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 66 transitions. [2024-11-12 21:44:37,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-12 21:44:37,781 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-12 21:44:37,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2024-11-12 21:44:37,781 INFO L240 hiAutomatonCegarLoop]: Abstraction has 58 states and 66 transitions. [2024-11-12 21:44:37,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 21:44:37,783 INFO L426 stractBuchiCegarLoop]: Abstraction has 58 states and 66 transitions. [2024-11-12 21:44:37,783 INFO L333 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-12 21:44:37,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 66 transitions. [2024-11-12 21:44:37,784 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-12 21:44:37,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:44:37,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:44:37,786 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-12 21:44:37,786 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [42, 42, 36, 36, 36, 8, 8, 6, 6, 6, 6, 6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:44:37,786 INFO L747 eck$LassoCheckResult]: Stem: "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);" "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#4(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "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);"< [2024-11-12 21:44:37,786 INFO L749 eck$LassoCheckResult]: Loop: "~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);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(0, ~b.base, ~b.offset, 4);" "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);"< "~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#4(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#5(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#5(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#5(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#5(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#104#return;" "assume true;" >"#104#return;" "assume true;" >"#98#return;" "call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#100#return;" "assume true;" >"#112#return;" "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;" "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);"< [2024-11-12 21:44:37,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:37,787 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 10 times [2024-11-12 21:44:37,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:37,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317236368] [2024-11-12 21:44:37,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:37,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:37,799 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:44:37,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:37,805 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:44:37,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:37,808 INFO L85 PathProgramCache]: Analyzing trace with hash 2128654850, now seen corresponding path program 6 times [2024-11-12 21:44:37,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:37,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50511129] [2024-11-12 21:44:37,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:37,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:37,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:38,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:39,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:40,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:40,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:40,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:40,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:40,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:40,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:40,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:40,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:40,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:40,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:40,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:40,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:40,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:40,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:44:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:41,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:41,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:41,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:41,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:41,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:41,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:41,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:41,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:41,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:41,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:41,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:41,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:41,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:41,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:44:41,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:41,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:41,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:41,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:41,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:41,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:41,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:41,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:41,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:41,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:41,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:41,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:41,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:41,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:41,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:44:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:41,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 21:44:41,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:41,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:41,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:41,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:41,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:41,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:41,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:41,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:41,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:41,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:41,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:41,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:41,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:41,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:41,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:41,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:41,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:44:41,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:41,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:41,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:41,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:41,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:41,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:41,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:41,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:41,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:41,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:41,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:41,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:41,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:41,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:44:41,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:41,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:41,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:41,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:41,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:41,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:41,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:41,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:41,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:41,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:41,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:41,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:41,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:41,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:44:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:41,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 21:44:41,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:41,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-11-12 21:44:41,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:41,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:44:41,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50511129] [2024-11-12 21:44:41,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50511129] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:44:41,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838310176] [2024-11-12 21:44:41,587 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-12 21:44:41,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:44:41,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:44:41,592 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:44:41,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-12 21:44:41,799 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 21:44:41,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 21:44:41,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2024-11-12 21:44:41,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728008228] [2024-11-12 21:44:41,799 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 21:44:41,800 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 21:44:41,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:44:41,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 21:44:41,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-11-12 21:44:41,800 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. cyclomatic complexity: 13 Second operand has 15 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 11 states have internal predecessors, (35), 5 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2024-11-12 21:44:42,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:44:42,029 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2024-11-12 21:44:42,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 68 transitions. [2024-11-12 21:44:42,029 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-12 21:44:42,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 60 states and 68 transitions. [2024-11-12 21:44:42,031 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2024-11-12 21:44:42,031 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2024-11-12 21:44:42,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 68 transitions. [2024-11-12 21:44:42,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:44:42,031 INFO L218 hiAutomatonCegarLoop]: Abstraction has 60 states and 68 transitions. [2024-11-12 21:44:42,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 68 transitions. [2024-11-12 21:44:42,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-12 21:44:42,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 33 states have (on average 1.121212121212121) internal successors, (37), 37 states have internal predecessors, (37), 10 states have call successors, (10), 5 states have call predecessors, (10), 17 states have return successors, (21), 17 states have call predecessors, (21), 8 states have call successors, (21) [2024-11-12 21:44:42,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2024-11-12 21:44:42,035 INFO L240 hiAutomatonCegarLoop]: Abstraction has 60 states and 68 transitions. [2024-11-12 21:44:42,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 21:44:42,036 INFO L426 stractBuchiCegarLoop]: Abstraction has 60 states and 68 transitions. [2024-11-12 21:44:42,036 INFO L333 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-12 21:44:42,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 68 transitions. [2024-11-12 21:44:42,036 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-12 21:44:42,036 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:44:42,036 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:44:42,038 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-12 21:44:42,038 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [56, 56, 48, 48, 48, 10, 10, 8, 8, 8, 8, 8, 8, 8, 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-12 21:44:42,038 INFO L747 eck$LassoCheckResult]: Stem: "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);" "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#4(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "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);"< [2024-11-12 21:44:42,038 INFO L749 eck$LassoCheckResult]: Loop: "~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);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(0, ~b.base, ~b.offset, 4);" "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);"< "~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#4(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#5(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#5(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#5(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#5(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#104#return;" "assume true;" >"#104#return;" "assume true;" >"#98#return;" "call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#100#return;" "assume true;" >"#112#return;" "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;" "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);"< [2024-11-12 21:44:42,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:42,039 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 11 times [2024-11-12 21:44:42,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:42,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359803448] [2024-11-12 21:44:42,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:42,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:42,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:42,052 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:44:42,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:42,063 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:44:42,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:42,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1834638806, now seen corresponding path program 7 times [2024-11-12 21:44:42,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:42,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580578874] [2024-11-12 21:44:42,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:42,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:42,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:43,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:44,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:45,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:45,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:45,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:45,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:45,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:45,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:45,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:45,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:45,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:45,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:45,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:45,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:45,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:45,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:44:45,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:45,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:45,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:45,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:45,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:45,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:45,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:45,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:45,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:45,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:45,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:45,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:45,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:45,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:44:45,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:45,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:45,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:45,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:45,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:45,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:45,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:45,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:45,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:45,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:45,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:45,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:45,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:45,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:45,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:44:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:45,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:45,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:45,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:45,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:45,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:45,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:45,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:45,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:45,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:45,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:45,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:45,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:45,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:44:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:45,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-12 21:44:45,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:46,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:46,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:47,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:47,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:47,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:47,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:47,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:47,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:47,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:47,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:47,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:47,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:47,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:47,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:44:47,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:47,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:47,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:47,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:47,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:47,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:47,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:47,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:47,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:47,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:47,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:47,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:47,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:47,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:47,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:44:47,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:48,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:48,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:48,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:48,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:48,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:48,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:48,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:48,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:48,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:48,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:48,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:48,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:44:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:48,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:48,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:48,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:48,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:48,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:48,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:48,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:48,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:48,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:48,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:48,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:48,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:48,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:48,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:44:48,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:48,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-12 21:44:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:48,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2024-11-12 21:44:48,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:48,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:44:48,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580578874] [2024-11-12 21:44:48,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580578874] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:44:48,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689474323] [2024-11-12 21:44:48,355 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-12 21:44:48,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:44:48,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:44:48,361 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:44:48,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-12 21:44:48,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:48,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 2204 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-12 21:44:48,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 21:44:48,960 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-12 21:44:49,385 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 21:44:52,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689474323] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 21:44:52,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 21:44:52,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 12, 22] total 48 [2024-11-12 21:44:52,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569661118] [2024-11-12 21:44:52,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 21:44:52,140 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 21:44:52,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:44:52,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-12 21:44:52,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=1921, Unknown=0, NotChecked=0, Total=2256 [2024-11-12 21:44:52,147 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. cyclomatic complexity: 13 Second operand has 48 states, 36 states have (on average 2.4722222222222223) internal successors, (89), 38 states have internal predecessors, (89), 21 states have call successors, (42), 12 states have call predecessors, (42), 14 states have return successors, (39), 19 states have call predecessors, (39), 21 states have call successors, (39) [2024-11-12 21:44:53,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:44:53,107 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2024-11-12 21:44:53,107 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 72 transitions. [2024-11-12 21:44:53,108 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-12 21:44:53,108 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 64 states and 72 transitions. [2024-11-12 21:44:53,108 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2024-11-12 21:44:53,108 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2024-11-12 21:44:53,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 72 transitions. [2024-11-12 21:44:53,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:44:53,109 INFO L218 hiAutomatonCegarLoop]: Abstraction has 64 states and 72 transitions. [2024-11-12 21:44:53,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 72 transitions. [2024-11-12 21:44:53,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-12 21:44:53,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 39 states have internal predecessors, (39), 10 states have call successors, (10), 5 states have call predecessors, (10), 19 states have return successors, (23), 19 states have call predecessors, (23), 8 states have call successors, (23) [2024-11-12 21:44:53,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2024-11-12 21:44:53,119 INFO L240 hiAutomatonCegarLoop]: Abstraction has 64 states and 72 transitions. [2024-11-12 21:44:53,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-12 21:44:53,124 INFO L426 stractBuchiCegarLoop]: Abstraction has 64 states and 72 transitions. [2024-11-12 21:44:53,124 INFO L333 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-12 21:44:53,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 72 transitions. [2024-11-12 21:44:53,124 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-12 21:44:53,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:44:53,124 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:44:53,126 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-12 21:44:53,126 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [84, 84, 72, 72, 72, 14, 14, 12, 12, 12, 12, 12, 12, 12, 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-12 21:44:53,126 INFO L747 eck$LassoCheckResult]: Stem: "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);" "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#4(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "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);"< [2024-11-12 21:44:53,126 INFO L749 eck$LassoCheckResult]: Loop: "~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);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(0, ~b.base, ~b.offset, 4);" "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);"< "~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#4(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#5(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#5(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#5(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#5(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#104#return;" "assume true;" >"#104#return;" "assume true;" >"#98#return;" "call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#100#return;" "assume true;" >"#112#return;" "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;" "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);"< [2024-11-12 21:44:53,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:53,135 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 12 times [2024-11-12 21:44:53,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:53,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642900626] [2024-11-12 21:44:53,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:53,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:53,144 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:44:53,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:53,150 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:44:53,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:53,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1039651946, now seen corresponding path program 8 times [2024-11-12 21:44:53,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:53,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741258446] [2024-11-12 21:44:53,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:53,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:53,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:55,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:55,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:56,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:56,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:57,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:57,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:57,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:57,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:57,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:57,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:57,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:57,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:57,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:57,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:57,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:57,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:57,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:57,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:44:57,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:57,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:44:58,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:44:58,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:44:58,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:44:58,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:44:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-12 21:44:58,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:44:58,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:44:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:58,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:58,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:44:59,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:59,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:59,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:59,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:59,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:59,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:59,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:59,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:59,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:59,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:59,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:44:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:59,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:59,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:59,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:59,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:59,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:59,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:59,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:59,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:59,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:59,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:59,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:59,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:44:59,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:59,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:59,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:59,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:59,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:59,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:59,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:59,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:59,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:59,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:59,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:59,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:59,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:44:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:59,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:44:59,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:59,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-12 21:44:59,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:59,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 522 [2024-11-12 21:44:59,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:44:59,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:44:59,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741258446] [2024-11-12 21:44:59,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741258446] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:44:59,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745647508] [2024-11-12 21:44:59,201 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 21:44:59,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:44:59,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:44:59,202 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:44:59,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-12 21:44:59,577 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 21:44:59,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 21:44:59,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2024-11-12 21:44:59,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415654516] [2024-11-12 21:44:59,578 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 21:44:59,578 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 21:44:59,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:44:59,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 21:44:59,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-11-12 21:44:59,579 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. cyclomatic complexity: 13 Second operand has 15 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 7 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2024-11-12 21:44:59,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:44:59,777 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2024-11-12 21:44:59,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 74 transitions. [2024-11-12 21:44:59,778 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-12 21:44:59,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 66 states and 74 transitions. [2024-11-12 21:44:59,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2024-11-12 21:44:59,779 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2024-11-12 21:44:59,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 74 transitions. [2024-11-12 21:44:59,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:44:59,779 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66 states and 74 transitions. [2024-11-12 21:44:59,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 74 transitions. [2024-11-12 21:44:59,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-12 21:44:59,782 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-12 21:44:59,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2024-11-12 21:44:59,782 INFO L240 hiAutomatonCegarLoop]: Abstraction has 66 states and 74 transitions. [2024-11-12 21:44:59,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 21:44:59,783 INFO L426 stractBuchiCegarLoop]: Abstraction has 66 states and 74 transitions. [2024-11-12 21:44:59,783 INFO L333 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-12 21:44:59,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 74 transitions. [2024-11-12 21:44:59,783 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-12 21:44:59,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:44:59,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:44:59,786 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-12 21:44:59,786 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [126, 126, 108, 108, 108, 21, 21, 18, 18, 18, 18, 18, 18, 18, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:44:59,787 INFO L747 eck$LassoCheckResult]: Stem: "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);" "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#4(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "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);"< [2024-11-12 21:44:59,787 INFO L749 eck$LassoCheckResult]: Loop: "~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);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(0, ~b.base, ~b.offset, 4);" "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);"< "~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#4(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#5(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#5(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#5(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#5(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#5(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#104#return;" "assume true;" >"#104#return;" "assume true;" >"#104#return;" "assume true;" >"#98#return;" "call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#100#return;" "assume true;" >"#112#return;" "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;" "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);"< [2024-11-12 21:44:59,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:59,788 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 13 times [2024-11-12 21:44:59,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:59,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328470302] [2024-11-12 21:44:59,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:59,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:44:59,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:59,798 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:44:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:44:59,806 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:44:59,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:44:59,807 INFO L85 PathProgramCache]: Analyzing trace with hash 893084031, now seen corresponding path program 9 times [2024-11-12 21:44:59,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:44:59,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538383116] [2024-11-12 21:44:59,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:44:59,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:45:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:02,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:05,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:05,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:07,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:07,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:07,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:07,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:07,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:07,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:07,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:07,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:07,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:07,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:07,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:07,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:07,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:07,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:45:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:07,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:07,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:07,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:07,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:07,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:07,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:07,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:07,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:07,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:07,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:07,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:45:07,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:07,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:07,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:07,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:07,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:07,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:07,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:07,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:07,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:07,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:07,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:07,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:07,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:45:07,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:07,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:07,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:07,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:07,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:07,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:07,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:07,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:08,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:08,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:08,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:08,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:08,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:08,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:08,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:08,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:45:08,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:08,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:08,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:08,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:08,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:08,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:08,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:08,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:08,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:08,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:08,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:08,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:08,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:08,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:45:08,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:08,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:08,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:08,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:08,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:08,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:08,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:08,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:08,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:08,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:08,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:08,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:08,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:45:08,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:08,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-12 21:45:08,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:09,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:09,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:09,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:09,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:45:09,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:09,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:09,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:09,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:09,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:09,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:45:09,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:09,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:09,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:09,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:09,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:09,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:09,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:09,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:45:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:09,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:09,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:09,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:09,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:09,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:09,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:45:09,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:09,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:09,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:09,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:45:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:09,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:09,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:45:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:09,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-12 21:45:10,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:10,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:10,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:10,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:45:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:10,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:10,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:10,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:10,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:10,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:45:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:10,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:10,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:10,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:45:10,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:10,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:10,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:10,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:10,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:10,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:45:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:10,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:10,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:10,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:10,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:10,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:45:10,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:10,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:10,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:10,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:10,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:45:10,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-12 21:45:10,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 779 [2024-11-12 21:45:10,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:10,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:45:10,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538383116] [2024-11-12 21:45:10,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538383116] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:45:10,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032846716] [2024-11-12 21:45:10,868 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 21:45:10,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:45:10,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:45:10,870 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:45:10,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-12 21:45:11,380 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 21:45:11,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 21:45:11,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2024-11-12 21:45:11,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372979742] [2024-11-12 21:45:11,381 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 21:45:11,382 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 21:45:11,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:45:11,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 21:45:11,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-11-12 21:45:11,382 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. cyclomatic complexity: 13 Second operand has 16 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 7 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2024-11-12 21:45:11,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:45:11,599 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2024-11-12 21:45:11,600 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 76 transitions. [2024-11-12 21:45:11,600 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-12 21:45:11,601 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 68 states and 76 transitions. [2024-11-12 21:45:11,601 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2024-11-12 21:45:11,601 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2024-11-12 21:45:11,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 76 transitions. [2024-11-12 21:45:11,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:45:11,602 INFO L218 hiAutomatonCegarLoop]: Abstraction has 68 states and 76 transitions. [2024-11-12 21:45:11,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 76 transitions. [2024-11-12 21:45:11,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-12 21:45:11,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 41 states have internal predecessors, (41), 10 states have call successors, (10), 5 states have call predecessors, (10), 21 states have return successors, (25), 21 states have call predecessors, (25), 8 states have call successors, (25) [2024-11-12 21:45:11,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2024-11-12 21:45:11,604 INFO L240 hiAutomatonCegarLoop]: Abstraction has 68 states and 76 transitions. [2024-11-12 21:45:11,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 21:45:11,605 INFO L426 stractBuchiCegarLoop]: Abstraction has 68 states and 76 transitions. [2024-11-12 21:45:11,605 INFO L333 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-11-12 21:45:11,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 76 transitions. [2024-11-12 21:45:11,606 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-12 21:45:11,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:45:11,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:45:11,609 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-12 21:45:11,609 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [168, 168, 144, 144, 144, 28, 28, 24, 24, 24, 24, 24, 24, 24, 5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:45:11,609 INFO L747 eck$LassoCheckResult]: Stem: "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);" "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#4(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "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);"< [2024-11-12 21:45:11,610 INFO L749 eck$LassoCheckResult]: Loop: "~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);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(0, ~b.base, ~b.offset, 4);" "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);"< "~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#4(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#5(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#5(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#5(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#5(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#5(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#5(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#104#return;" "assume true;" >"#104#return;" "assume true;" >"#104#return;" "assume true;" >"#104#return;" "assume true;" >"#98#return;" "call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#100#return;" "assume true;" >"#112#return;" "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;" "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);"< [2024-11-12 21:45:11,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:45:11,610 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 14 times [2024-11-12 21:45:11,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:45:11,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966227013] [2024-11-12 21:45:11,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:45:11,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:45:11,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:45:11,621 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:45:11,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:45:11,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:45:11,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:45:11,631 INFO L85 PathProgramCache]: Analyzing trace with hash -361009028, now seen corresponding path program 10 times [2024-11-12 21:45:11,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:45:11,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483008805] [2024-11-12 21:45:11,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:45:11,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:45:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:16,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:20,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:21,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:26,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:26,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:26,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:26,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:26,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:26,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:45:26,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:26,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:26,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:26,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:45:26,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:26,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:26,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:26,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:26,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:26,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:45:26,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:26,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:26,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:26,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:26,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:45:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:26,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:26,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:45:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:26,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:26,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:45:26,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:26,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-12 21:45:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:29,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:29,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:29,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:29,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:29,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:29,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:29,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:45:29,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:29,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:29,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:29,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:29,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:29,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:29,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:45:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:29,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:29,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:29,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:29,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:45:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:29,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:29,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:29,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:29,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:29,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:29,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:45:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:29,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:29,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:29,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:29,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:29,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:29,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:29,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:45:29,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:29,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:29,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:29,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:29,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:29,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:45:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:29,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-12 21:45:29,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:30,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:30,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:30,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:30,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:45:31,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:45:31,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:45:31,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:45:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:45:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:45:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-12 21:45:31,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:45:31,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:45:31,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:31,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:45:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:32,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:32,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:32,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:32,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:32,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:32,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:32,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:32,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:32,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:32,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:32,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:32,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:45:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:32,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:32,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:32,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:32,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:32,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:32,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:32,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:32,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:32,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:32,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:32,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:32,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:32,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:32,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:32,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:45:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:32,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:32,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:32,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:32,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:32,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:32,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:32,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:32,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:32,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:32,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:32,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:32,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 21:45:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:32,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-12 21:45:32,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:32,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1036 [2024-11-12 21:45:32,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:32,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 21:45:32,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483008805] [2024-11-12 21:45:32,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483008805] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 21:45:32,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365023587] [2024-11-12 21:45:32,183 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-12 21:45:32,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 21:45:32,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 21:45:32,188 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 21:45:32,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-12 21:45:32,925 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 21:45:32,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 21:45:32,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2024-11-12 21:45:32,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294651380] [2024-11-12 21:45:32,927 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 21:45:32,927 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-12 21:45:32,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 21:45:32,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-12 21:45:32,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-11-12 21:45:32,928 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. cyclomatic complexity: 13 Second operand has 17 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 7 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (12), 8 states have call predecessors, (12), 7 states have call successors, (12) [2024-11-12 21:45:33,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 21:45:33,157 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2024-11-12 21:45:33,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 78 transitions. [2024-11-12 21:45:33,158 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-12 21:45:33,158 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 70 states and 78 transitions. [2024-11-12 21:45:33,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2024-11-12 21:45:33,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2024-11-12 21:45:33,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 78 transitions. [2024-11-12 21:45:33,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-12 21:45:33,159 INFO L218 hiAutomatonCegarLoop]: Abstraction has 70 states and 78 transitions. [2024-11-12 21:45:33,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 78 transitions. [2024-11-12 21:45:33,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-12 21:45:33,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 38 states have (on average 1.105263157894737) internal successors, (42), 42 states have internal predecessors, (42), 10 states have call successors, (10), 5 states have call predecessors, (10), 22 states have return successors, (26), 22 states have call predecessors, (26), 8 states have call successors, (26) [2024-11-12 21:45:33,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2024-11-12 21:45:33,162 INFO L240 hiAutomatonCegarLoop]: Abstraction has 70 states and 78 transitions. [2024-11-12 21:45:33,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 21:45:33,162 INFO L426 stractBuchiCegarLoop]: Abstraction has 70 states and 78 transitions. [2024-11-12 21:45:33,163 INFO L333 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-11-12 21:45:33,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 78 transitions. [2024-11-12 21:45:33,163 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-11-12 21:45:33,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-12 21:45:33,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-12 21:45:33,166 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-12 21:45:33,166 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [210, 210, 180, 180, 180, 35, 35, 30, 30, 30, 30, 30, 30, 30, 6, 6, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 21:45:33,167 INFO L747 eck$LassoCheckResult]: Stem: "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);" "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#4(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#1(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "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);"< [2024-11-12 21:45:33,167 INFO L749 eck$LassoCheckResult]: Loop: "~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);" "assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(0, ~b.base, ~b.offset, 4);" "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);"< "~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#4(~b.base, ~b.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#5(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#5(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#5(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#5(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#5(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#5(~c.base, ~c.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~e.base, ~e.offset, 4);" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#3(~e.base, ~e.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#106#return;" "assume true;" >"#108#return;" "call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);"< "~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#110#return;" "assume true;" >"#102#return;" "call #t~mem11 := read~int#5(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#5(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#5(~c.base, ~c.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#104#return;" "assume true;" >"#104#return;" "assume true;" >"#104#return;" "assume true;" >"#104#return;" "assume true;" >"#104#return;" "assume true;" >"#98#return;" "call #t~mem14 := read~int#4(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< "~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#4(~b.base, ~b.offset, 4);" "assume !(#t~mem13 < 6);havoc #t~mem13;" "assume true;" >"#100#return;" "assume true;" >"#112#return;" "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;" "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);"< [2024-11-12 21:45:33,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:45:33,168 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 15 times [2024-11-12 21:45:33,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:45:33,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993733644] [2024-11-12 21:45:33,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:45:33,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:45:33,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:45:33,181 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 21:45:33,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 21:45:33,193 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 21:45:33,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 21:45:33,194 INFO L85 PathProgramCache]: Analyzing trace with hash -427200667, now seen corresponding path program 11 times [2024-11-12 21:45:33,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 21:45:33,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202314318] [2024-11-12 21:45:33,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 21:45:33,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 21:45:33,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 21:45:40,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 21:45:40,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat