./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/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.fs.cvc5-61a6796-m [2024-10-15 00:58:08,164 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 00:58:08,219 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-15 00:58:08,224 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 00:58:08,225 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 00:58:08,250 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 00:58:08,250 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 00:58:08,251 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 00:58:08,251 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 00:58:08,252 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 00:58:08,252 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 00:58:08,253 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 00:58:08,253 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 00:58:08,255 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-15 00:58:08,255 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-15 00:58:08,255 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-15 00:58:08,255 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-15 00:58:08,255 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-15 00:58:08,256 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-15 00:58:08,256 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 00:58:08,256 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-15 00:58:08,259 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 00:58:08,259 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 00:58:08,259 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 00:58:08,260 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 00:58:08,260 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-15 00:58:08,260 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-15 00:58:08,260 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-15 00:58:08,261 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 00:58:08,261 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-15 00:58:08,261 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 00:58:08,261 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 00:58:08,261 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-15 00:58:08,261 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 00:58:08,262 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 00:58:08,262 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 00:58:08,262 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 00:58:08,262 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 00:58:08,262 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-15 00:58:08,263 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-10-15 00:58:08,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 00:58:08,540 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 00:58:08,544 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 00:58:08,545 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 00:58:08,546 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 00:58:08,547 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2024-10-15 00:58:10,051 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 00:58:10,258 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 00:58:10,258 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2024-10-15 00:58:10,277 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/438b0d52b/638af0e6d2144ceeae18b70002409c03/FLAG4f7b60b93 [2024-10-15 00:58:10,297 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/438b0d52b/638af0e6d2144ceeae18b70002409c03 [2024-10-15 00:58:10,300 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 00:58:10,301 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 00:58:10,304 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 00:58:10,304 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 00:58:10,310 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 00:58:10,312 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:58:10" (1/1) ... [2024-10-15 00:58:10,312 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d3c3c5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:58:10, skipping insertion in model container [2024-10-15 00:58:10,313 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:58:10" (1/1) ... [2024-10-15 00:58:10,344 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 00:58:10,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:58:10,637 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 00:58:10,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:58:10,702 INFO L204 MainTranslator]: Completed translation [2024-10-15 00:58:10,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:58:10 WrapperNode [2024-10-15 00:58:10,703 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 00:58:10,704 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 00:58:10,704 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 00:58:10,716 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 00:58:10,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:58:10" (1/1) ... [2024-10-15 00:58:10,729 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:58:10" (1/1) ... [2024-10-15 00:58:10,744 INFO L138 Inliner]: procedures = 16, calls = 63, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2024-10-15 00:58:10,746 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 00:58:10,746 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 00:58:10,746 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 00:58:10,746 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 00:58:10,755 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:58:10" (1/1) ... [2024-10-15 00:58:10,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:58:10" (1/1) ... [2024-10-15 00:58:10,762 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:58:10" (1/1) ... [2024-10-15 00:58:10,786 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-10-15 00:58:10,786 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:58:10" (1/1) ... [2024-10-15 00:58:10,786 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:58:10" (1/1) ... [2024-10-15 00:58:10,793 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:58:10" (1/1) ... [2024-10-15 00:58:10,799 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:58:10" (1/1) ... [2024-10-15 00:58:10,803 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:58:10" (1/1) ... [2024-10-15 00:58:10,804 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:58:10" (1/1) ... [2024-10-15 00:58:10,810 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 00:58:10,812 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 00:58:10,812 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 00:58:10,812 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 00:58:10,813 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:58:10" (1/1) ... [2024-10-15 00:58:10,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:58:10,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:58:10,855 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-10-15 00:58:10,861 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-10-15 00:58:10,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 00:58:10,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 00:58:10,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-15 00:58:10,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-15 00:58:10,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-15 00:58:10,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-15 00:58:10,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-15 00:58:10,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-15 00:58:10,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-15 00:58:10,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-15 00:58:10,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-15 00:58:10,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-15 00:58:10,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-15 00:58:10,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-15 00:58:10,901 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2024-10-15 00:58:10,901 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2024-10-15 00:58:10,901 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2024-10-15 00:58:10,901 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2024-10-15 00:58:10,901 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_26_0 [2024-10-15 00:58:10,901 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_26_0 [2024-10-15 00:58:10,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 00:58:10,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 00:58:10,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-15 00:58:10,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-15 00:58:10,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-15 00:58:10,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-15 00:58:10,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-15 00:58:10,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-15 00:58:10,902 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_27_0 [2024-10-15 00:58:10,902 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_27_0 [2024-10-15 00:58:10,902 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_27_0 [2024-10-15 00:58:10,902 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_27_0 [2024-10-15 00:58:10,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-15 00:58:10,995 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 00:58:10,997 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 00:58:11,206 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-10-15 00:58:11,206 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 00:58:11,223 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 00:58:11,224 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-15 00:58:11,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:58:11 BoogieIcfgContainer [2024-10-15 00:58:11,224 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 00:58:11,225 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-15 00:58:11,225 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-15 00:58:11,229 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-15 00:58:11,229 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:58:11,229 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.10 12:58:10" (1/3) ... [2024-10-15 00:58:11,230 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3309f7e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:58:11, skipping insertion in model container [2024-10-15 00:58:11,230 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:58:11,231 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:58:10" (2/3) ... [2024-10-15 00:58:11,231 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3309f7e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:58:11, skipping insertion in model container [2024-10-15 00:58:11,231 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:58:11,231 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:58:11" (3/3) ... [2024-10-15 00:58:11,232 INFO L332 chiAutomizerObserver]: Analyzing ICFG recursified_nested_5.c [2024-10-15 00:58:11,278 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-15 00:58:11,278 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-15 00:58:11,279 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-15 00:58:11,279 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-15 00:58:11,279 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-15 00:58:11,279 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-15 00:58:11,279 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-15 00:58:11,279 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-15 00:58:11,282 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-10-15 00:58:11,297 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-15 00:58:11,297 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:58:11,297 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:58:11,303 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-15 00:58:11,303 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:58:11,303 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-15 00:58:11,304 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-10-15 00:58:11,307 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-15 00:58:11,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:58:11,307 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:58:11,307 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-15 00:58:11,308 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:58:11,313 INFO L745 eck$LassoCheckResult]: Stem: 19#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 26#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 39#L128true call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 29#$Ultimate##0true [2024-10-15 00:58:11,314 INFO L747 eck$LassoCheckResult]: Loop: 29#$Ultimate##0true ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 5#L101true assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(0, ~b.base, ~b.offset, 4); 6#L107true call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 42#$Ultimate##0true ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#4(~b.base, ~b.offset, 4); 25#L81true assume !(#t~mem13 < 6);havoc #t~mem13; 21#L81-1true assume true; 20#func_to_recursive_line_24_to_25_0EXITtrue >#112#return; 3#L107-1true call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 34#L112true call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 29#$Ultimate##0true [2024-10-15 00:58:11,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:58:11,318 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 1 times [2024-10-15 00:58:11,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:58:11,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824673542] [2024-10-15 00:58:11,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:58:11,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:58:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:58:11,442 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:58:11,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:58:11,494 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:58:11,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:58:11,497 INFO L85 PathProgramCache]: Analyzing trace with hash 2053320187, now seen corresponding path program 1 times [2024-10-15 00:58:11,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:58:11,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711003675] [2024-10-15 00:58:11,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:58:11,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:58:11,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:11,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:11,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:11,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:58:11,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:58:11,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711003675] [2024-10-15 00:58:11,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711003675] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:58:11,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:58:11,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-15 00:58:11,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417039615] [2024-10-15 00:58:11,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:58:11,852 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:58:11,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:58:11,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-15 00:58:11,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-15 00:58:11,881 INFO L87 Difference]: Start difference. First operand has 50 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 39 states have internal predecessors, (44), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 00:58:12,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:58:12,143 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2024-10-15 00:58:12,144 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 76 transitions. [2024-10-15 00:58:12,155 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-15 00:58:12,168 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 42 states and 53 transitions. [2024-10-15 00:58:12,172 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-10-15 00:58:12,173 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-10-15 00:58:12,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 53 transitions. [2024-10-15 00:58:12,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:58:12,178 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 53 transitions. [2024-10-15 00:58:12,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 53 transitions. [2024-10-15 00:58:12,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2024-10-15 00:58:12,233 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-10-15 00:58:12,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2024-10-15 00:58:12,235 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-10-15 00:58:12,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 00:58:12,240 INFO L425 stractBuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-10-15 00:58:12,240 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-15 00:58:12,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 44 transitions. [2024-10-15 00:58:12,241 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-15 00:58:12,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:58:12,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:58:12,242 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-15 00:58:12,242 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-10-15 00:58:12,242 INFO L745 eck$LassoCheckResult]: Stem: 161#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 145#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 134#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 158#$Ultimate##0 [2024-10-15 00:58:12,243 INFO L747 eck$LassoCheckResult]: Loop: 158#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 143#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(0, ~b.base, ~b.offset, 4); 139#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 144#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#4(~b.base, ~b.offset, 4); 138#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~c.base, ~c.offset, 4); 141#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 159#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 160#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 149#L61-1 assume true; 146#func_to_recursive_line_25_to_26_0EXIT >#98#return; 148#L87-1 call #t~mem14 := read~int#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; 140#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 144#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#4(~b.base, ~b.offset, 4); 138#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 142#L81-1 assume true; 162#func_to_recursive_line_24_to_25_0EXIT >#100#return; 163#L81-1 assume true; 164#func_to_recursive_line_24_to_25_0EXIT >#112#return; 133#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 135#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 158#$Ultimate##0 [2024-10-15 00:58:12,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:58:12,244 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 2 times [2024-10-15 00:58:12,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:58:12,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480326014] [2024-10-15 00:58:12,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:58:12,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:58:12,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:58:12,262 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:58:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:58:12,275 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:58:12,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:58:12,275 INFO L85 PathProgramCache]: Analyzing trace with hash 54735792, now seen corresponding path program 1 times [2024-10-15 00:58:12,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:58:12,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214516441] [2024-10-15 00:58:12,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:58:12,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:58:12,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:12,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:12,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:12,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:12,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:12,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-15 00:58:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:12,591 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-15 00:58:12,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:58:12,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214516441] [2024-10-15 00:58:12,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214516441] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:58:12,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:58:12,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-15 00:58:12,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906952172] [2024-10-15 00:58:12,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:58:12,593 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:58:12,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:58:12,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-15 00:58:12,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-15 00:58:12,595 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. cyclomatic complexity: 13 Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-15 00:58:12,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:58:12,744 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2024-10-15 00:58:12,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 52 transitions. [2024-10-15 00:58:12,745 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-15 00:58:12,746 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 52 transitions. [2024-10-15 00:58:12,747 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-10-15 00:58:12,747 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-10-15 00:58:12,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 52 transitions. [2024-10-15 00:58:12,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:58:12,749 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 52 transitions. [2024-10-15 00:58:12,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 52 transitions. [2024-10-15 00:58:12,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2024-10-15 00:58:12,753 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-10-15 00:58:12,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2024-10-15 00:58:12,755 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 46 transitions. [2024-10-15 00:58:12,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-15 00:58:12,755 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 46 transitions. [2024-10-15 00:58:12,756 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-15 00:58:12,756 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 46 transitions. [2024-10-15 00:58:12,758 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-15 00:58:12,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:58:12,759 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:58:12,759 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-15 00:58:12,759 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-10-15 00:58:12,760 INFO L745 eck$LassoCheckResult]: Stem: 278#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 260#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 249#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 272#$Ultimate##0 [2024-10-15 00:58:12,761 INFO L747 eck$LassoCheckResult]: Loop: 272#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 258#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(0, ~b.base, ~b.offset, 4); 255#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 259#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#4(~b.base, ~b.offset, 4); 253#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~c.base, ~c.offset, 4); 256#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 273#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 276#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 267#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 265#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 268#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 270#L41-1 assume true; 269#func_to_recursive_line_26_to_27_0EXIT >#102#return; 271#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 262#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 273#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 276#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 277#L61-1 assume true; 261#func_to_recursive_line_25_to_26_0EXIT >#104#return; 263#L61-1 assume true; 275#func_to_recursive_line_25_to_26_0EXIT >#98#return; 274#L87-1 call #t~mem14 := read~int#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; 254#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 259#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#4(~b.base, ~b.offset, 4); 253#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 257#L81-1 assume true; 279#func_to_recursive_line_24_to_25_0EXIT >#100#return; 280#L81-1 assume true; 281#func_to_recursive_line_24_to_25_0EXIT >#112#return; 248#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 250#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 272#$Ultimate##0 [2024-10-15 00:58:12,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:58:12,761 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 3 times [2024-10-15 00:58:12,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:58:12,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010725863] [2024-10-15 00:58:12,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:58:12,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:58:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:58:12,781 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:58:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:58:12,792 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:58:12,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:58:12,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1525796123, now seen corresponding path program 1 times [2024-10-15 00:58:12,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:58:12,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038511566] [2024-10-15 00:58:12,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:58:12,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:58:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:12,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:12,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:13,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:13,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:13,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:13,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-15 00:58:13,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:13,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-15 00:58:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:13,192 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-15 00:58:13,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:58:13,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038511566] [2024-10-15 00:58:13,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038511566] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:58:13,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:58:13,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-15 00:58:13,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446704751] [2024-10-15 00:58:13,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:58:13,193 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:58:13,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:58:13,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-15 00:58:13,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-15 00:58:13,194 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. cyclomatic complexity: 13 Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-15 00:58:13,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:58:13,340 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2024-10-15 00:58:13,340 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 51 transitions. [2024-10-15 00:58:13,342 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-15 00:58:13,346 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 51 transitions. [2024-10-15 00:58:13,346 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-10-15 00:58:13,346 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-10-15 00:58:13,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 51 transitions. [2024-10-15 00:58:13,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:58:13,347 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 51 transitions. [2024-10-15 00:58:13,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 51 transitions. [2024-10-15 00:58:13,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2024-10-15 00:58:13,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 23 states have (on average 1.173913043478261) internal successors, (27), 27 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2024-10-15 00:58:13,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2024-10-15 00:58:13,350 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-10-15 00:58:13,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 00:58:13,353 INFO L425 stractBuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-10-15 00:58:13,353 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-15 00:58:13,353 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 48 transitions. [2024-10-15 00:58:13,354 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-15 00:58:13,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:58:13,355 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:58:13,355 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-15 00:58:13,356 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:58:13,357 INFO L745 eck$LassoCheckResult]: Stem: 429#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 408#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 393#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 419#$Ultimate##0 [2024-10-15 00:58:13,357 INFO L747 eck$LassoCheckResult]: Loop: 419#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 406#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(0, ~b.base, ~b.offset, 4); 402#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 407#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#4(~b.base, ~b.offset, 4); 401#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~c.base, ~c.offset, 4); 404#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 421#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 425#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 414#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 413#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 416#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 397#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 399#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 400#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 395#L25-1 assume true; 398#func_to_recursive_line_27_to_27_0EXIT >#108#return; 412#L47-1 call #t~mem8 := read~int#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; 415#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 413#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 416#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 420#L41-1 assume true; 417#func_to_recursive_line_26_to_27_0EXIT >#110#return; 418#L41-1 assume true; 431#func_to_recursive_line_26_to_27_0EXIT >#102#return; 423#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 410#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 421#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 425#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 426#L61-1 assume true; 409#func_to_recursive_line_25_to_26_0EXIT >#104#return; 411#L61-1 assume true; 424#func_to_recursive_line_25_to_26_0EXIT >#98#return; 422#L87-1 call #t~mem14 := read~int#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; 403#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 407#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#4(~b.base, ~b.offset, 4); 401#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 405#L81-1 assume true; 427#func_to_recursive_line_24_to_25_0EXIT >#100#return; 428#L81-1 assume true; 430#func_to_recursive_line_24_to_25_0EXIT >#112#return; 392#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 394#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 419#$Ultimate##0 [2024-10-15 00:58:13,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:58:13,358 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 4 times [2024-10-15 00:58:13,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:58:13,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312105699] [2024-10-15 00:58:13,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:58:13,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:58:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:58:13,376 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:58:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:58:13,385 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:58:13,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:58:13,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1439872263, now seen corresponding path program 1 times [2024-10-15 00:58:13,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:58:13,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357091758] [2024-10-15 00:58:13,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:58:13,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:58:13,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:13,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:13,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:13,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:13,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:13,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:13,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:13,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-15 00:58:13,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:13,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-15 00:58:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:13,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-15 00:58:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:13,783 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-15 00:58:13,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:58:13,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357091758] [2024-10-15 00:58:13,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357091758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:58:13,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:58:13,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-15 00:58:13,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766841065] [2024-10-15 00:58:13,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:58:13,785 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:58:13,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:58:13,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-15 00:58:13,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-15 00:58:13,786 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. cyclomatic complexity: 13 Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 1 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-15 00:58:13,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:58:13,915 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2024-10-15 00:58:13,915 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 50 transitions. [2024-10-15 00:58:13,916 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-15 00:58:13,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 50 transitions. [2024-10-15 00:58:13,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-10-15 00:58:13,918 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-10-15 00:58:13,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 50 transitions. [2024-10-15 00:58:13,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:58:13,918 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 50 transitions. [2024-10-15 00:58:13,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 50 transitions. [2024-10-15 00:58:13,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-15 00:58:13,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 28 states have internal predecessors, (28), 10 states have call successors, (10), 5 states have call predecessors, (10), 8 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2024-10-15 00:58:13,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2024-10-15 00:58:13,921 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 50 transitions. [2024-10-15 00:58:13,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-15 00:58:13,922 INFO L425 stractBuchiCegarLoop]: Abstraction has 42 states and 50 transitions. [2024-10-15 00:58:13,922 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-15 00:58:13,922 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 50 transitions. [2024-10-15 00:58:13,923 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-15 00:58:13,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:58:13,923 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:58:13,924 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-15 00:58:13,924 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:58:13,924 INFO L745 eck$LassoCheckResult]: Stem: 621#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 600#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 585#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 611#$Ultimate##0 [2024-10-15 00:58:13,925 INFO L747 eck$LassoCheckResult]: Loop: 611#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 598#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(0, ~b.base, ~b.offset, 4); 594#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 599#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#4(~b.base, ~b.offset, 4); 593#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~c.base, ~c.offset, 4); 596#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 613#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 617#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 606#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 605#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 608#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 588#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 591#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 592#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 589#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 591#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 592#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 587#L25-1 assume true; 590#func_to_recursive_line_27_to_27_0EXIT >#106#return; 604#L25-1 assume true; 624#func_to_recursive_line_27_to_27_0EXIT >#108#return; 622#L47-1 call #t~mem8 := read~int#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; 607#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 605#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 608#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 612#L41-1 assume true; 609#func_to_recursive_line_26_to_27_0EXIT >#110#return; 610#L41-1 assume true; 625#func_to_recursive_line_26_to_27_0EXIT >#102#return; 615#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 602#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 613#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 617#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 618#L61-1 assume true; 601#func_to_recursive_line_25_to_26_0EXIT >#104#return; 603#L61-1 assume true; 616#func_to_recursive_line_25_to_26_0EXIT >#98#return; 614#L87-1 call #t~mem14 := read~int#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; 595#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 599#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#4(~b.base, ~b.offset, 4); 593#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 597#L81-1 assume true; 619#func_to_recursive_line_24_to_25_0EXIT >#100#return; 620#L81-1 assume true; 623#func_to_recursive_line_24_to_25_0EXIT >#112#return; 584#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 586#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 611#$Ultimate##0 [2024-10-15 00:58:13,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:58:13,925 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 5 times [2024-10-15 00:58:13,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:58:13,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296923762] [2024-10-15 00:58:13,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:58:13,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:58:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:58:13,936 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:58:13,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:58:13,947 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:58:13,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:58:13,947 INFO L85 PathProgramCache]: Analyzing trace with hash 405682375, now seen corresponding path program 1 times [2024-10-15 00:58:13,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:58:13,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489106846] [2024-10-15 00:58:13,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:58:13,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:58:13,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:14,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:14,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:14,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:14,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:14,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:14,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:14,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:14,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:14,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-15 00:58:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:14,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-15 00:58:14,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:14,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-15 00:58:14,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:14,722 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-15 00:58:14,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:58:14,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489106846] [2024-10-15 00:58:14,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489106846] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:58:14,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187040382] [2024-10-15 00:58:14,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:58:14,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:58:14,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:58:14,726 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-10-15 00:58:14,729 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-10-15 00:58:14,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:14,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-15 00:58:14,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:58:14,933 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-10-15 00:58:15,161 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-15 00:58:15,162 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:58:15,826 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-15 00:58:15,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187040382] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:58:15,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:58:15,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 29 [2024-10-15 00:58:15,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573491390] [2024-10-15 00:58:15,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:58:15,827 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:58:15,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:58:15,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-15 00:58:15,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2024-10-15 00:58:15,829 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. cyclomatic complexity: 13 Second operand has 29 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 22 states have internal predecessors, (56), 11 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (18), 7 states have call predecessors, (18), 11 states have call successors, (18) [2024-10-15 00:58:16,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:58:16,494 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2024-10-15 00:58:16,494 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 54 transitions. [2024-10-15 00:58:16,495 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-15 00:58:16,497 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 54 transitions. [2024-10-15 00:58:16,497 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2024-10-15 00:58:16,497 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2024-10-15 00:58:16,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 54 transitions. [2024-10-15 00:58:16,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:58:16,497 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-10-15 00:58:16,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 54 transitions. [2024-10-15 00:58:16,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-15 00:58:16,500 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-10-15 00:58:16,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2024-10-15 00:58:16,501 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-10-15 00:58:16,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-15 00:58:16,503 INFO L425 stractBuchiCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-10-15 00:58:16,503 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-15 00:58:16,503 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 54 transitions. [2024-10-15 00:58:16,504 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-15 00:58:16,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:58:16,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:58:16,506 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-15 00:58:16,506 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:58:16,506 INFO L745 eck$LassoCheckResult]: Stem: 1157#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 1139#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 1128#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 1150#$Ultimate##0 [2024-10-15 00:58:16,506 INFO L747 eck$LassoCheckResult]: Loop: 1150#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 1137#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(0, ~b.base, ~b.offset, 4); 1133#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1138#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#4(~b.base, ~b.offset, 4); 1132#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~c.base, ~c.offset, 4); 1135#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1152#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 1156#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 1146#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1144#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 1147#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 1125#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1130#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 1131#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1124#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1130#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 1131#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1124#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1130#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 1131#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1123#L25-1 assume true; 1126#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1140#L25-1 assume true; 1167#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1164#L25-1 assume true; 1163#func_to_recursive_line_27_to_27_0EXIT >#108#return; 1160#L47-1 call #t~mem8 := read~int#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; 1145#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1144#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 1147#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 1125#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1130#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 1131#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1124#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1130#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 1131#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1124#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1130#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 1131#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1123#L25-1 assume true; 1126#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1140#L25-1 assume true; 1167#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1164#L25-1 assume true; 1163#func_to_recursive_line_27_to_27_0EXIT >#108#return; 1160#L47-1 call #t~mem8 := read~int#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; 1145#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1144#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 1147#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1151#L41-1 assume true; 1148#func_to_recursive_line_26_to_27_0EXIT >#110#return; 1149#L41-1 assume true; 1168#func_to_recursive_line_26_to_27_0EXIT >#110#return; 1166#L41-1 assume true; 1165#func_to_recursive_line_26_to_27_0EXIT >#102#return; 1154#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 1142#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1152#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 1156#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1155#L61-1 assume true; 1141#func_to_recursive_line_25_to_26_0EXIT >#104#return; 1143#L61-1 assume true; 1162#func_to_recursive_line_25_to_26_0EXIT >#98#return; 1153#L87-1 call #t~mem14 := read~int#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; 1134#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1138#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#4(~b.base, ~b.offset, 4); 1132#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1136#L81-1 assume true; 1158#func_to_recursive_line_24_to_25_0EXIT >#100#return; 1159#L81-1 assume true; 1161#func_to_recursive_line_24_to_25_0EXIT >#112#return; 1127#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 1129#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 1150#$Ultimate##0 [2024-10-15 00:58:16,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:58:16,507 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 6 times [2024-10-15 00:58:16,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:58:16,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616727276] [2024-10-15 00:58:16,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:58:16,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:58:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:58:16,520 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:58:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:58:16,526 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:58:16,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:58:16,527 INFO L85 PathProgramCache]: Analyzing trace with hash 688040901, now seen corresponding path program 2 times [2024-10-15 00:58:16,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:58:16,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646301080] [2024-10-15 00:58:16,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:58:16,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:58:16,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:17,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:17,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:17,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:17,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:17,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:17,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:17,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:17,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:17,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:18,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-15 00:58:18,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:18,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:18,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:18,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:18,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:18,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:18,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-15 00:58:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:18,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-15 00:58:18,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:18,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-15 00:58:18,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:18,036 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 8 proven. 42 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-15 00:58:18,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:58:18,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646301080] [2024-10-15 00:58:18,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646301080] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:58:18,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212431509] [2024-10-15 00:58:18,036 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 00:58:18,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:58:18,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:58:18,042 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-10-15 00:58:18,043 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-10-15 00:58:18,175 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 00:58:18,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:58:18,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-10-15 00:58:18,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:58:18,233 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-10-15 00:58:18,490 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-10-15 00:58:18,490 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:58:19,705 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-15 00:58:19,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212431509] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:58:19,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:58:19,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 14] total 35 [2024-10-15 00:58:19,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553365708] [2024-10-15 00:58:19,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:58:19,707 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:58:19,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:58:19,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-15 00:58:19,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1033, Unknown=0, NotChecked=0, Total=1190 [2024-10-15 00:58:19,708 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. cyclomatic complexity: 13 Second operand has 35 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 27 states have internal predecessors, (65), 13 states have call successors, (28), 10 states have call predecessors, (28), 11 states have return successors, (24), 11 states have call predecessors, (24), 13 states have call successors, (24) [2024-10-15 00:58:20,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:58:20,299 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2024-10-15 00:58:20,299 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 58 transitions. [2024-10-15 00:58:20,300 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-15 00:58:20,301 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 58 transitions. [2024-10-15 00:58:20,301 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2024-10-15 00:58:20,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2024-10-15 00:58:20,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 58 transitions. [2024-10-15 00:58:20,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:58:20,301 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 58 transitions. [2024-10-15 00:58:20,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 58 transitions. [2024-10-15 00:58:20,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-15 00:58:20,304 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-10-15 00:58:20,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2024-10-15 00:58:20,305 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 58 transitions. [2024-10-15 00:58:20,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-15 00:58:20,305 INFO L425 stractBuchiCegarLoop]: Abstraction has 50 states and 58 transitions. [2024-10-15 00:58:20,306 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-15 00:58:20,306 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 58 transitions. [2024-10-15 00:58:20,306 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-15 00:58:20,306 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:58:20,306 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:58:20,308 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-15 00:58:20,308 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 12, 9, 9, 9, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:58:20,308 INFO L745 eck$LassoCheckResult]: Stem: 2014#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 1993#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 1983#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 2005#$Ultimate##0 [2024-10-15 00:58:20,308 INFO L747 eck$LassoCheckResult]: Loop: 2005#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 1991#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(0, ~b.base, ~b.offset, 4); 1988#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1992#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#4(~b.base, ~b.offset, 4); 1986#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~c.base, ~c.offset, 4); 1989#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2006#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 2011#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 1999#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1998#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 2001#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 1979#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1984#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 1985#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1978#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1984#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 1985#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1978#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1984#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 1985#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1978#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1984#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 1985#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2009#L25-1 assume true; 1997#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1977#L25-1 assume true; 1980#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2023#L25-1 assume true; 2022#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2019#L25-1 assume true; 2018#func_to_recursive_line_27_to_27_0EXIT >#108#return; 2015#L47-1 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; 2000#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1998#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 2001#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 1979#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1984#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 1985#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1978#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1984#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 1985#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1978#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1984#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 1985#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1978#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1984#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 1985#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2009#L25-1 assume true; 1997#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1977#L25-1 assume true; 1980#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2023#L25-1 assume true; 2022#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2019#L25-1 assume true; 2018#func_to_recursive_line_27_to_27_0EXIT >#108#return; 2015#L47-1 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; 2000#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1998#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 2001#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 1979#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1984#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 1985#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1978#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1984#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 1985#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1978#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1984#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 1985#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1978#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1984#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 1985#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2009#L25-1 assume true; 1997#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1977#L25-1 assume true; 1980#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2023#L25-1 assume true; 2022#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2019#L25-1 assume true; 2018#func_to_recursive_line_27_to_27_0EXIT >#108#return; 2015#L47-1 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; 2000#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1998#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 2001#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2004#L41-1 assume true; 2002#func_to_recursive_line_26_to_27_0EXIT >#110#return; 2003#L41-1 assume true; 2026#func_to_recursive_line_26_to_27_0EXIT >#110#return; 2025#L41-1 assume true; 2024#func_to_recursive_line_26_to_27_0EXIT >#110#return; 2021#L41-1 assume true; 2020#func_to_recursive_line_26_to_27_0EXIT >#102#return; 2008#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 1995#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2006#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 2011#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 2010#L61-1 assume true; 1994#func_to_recursive_line_25_to_26_0EXIT >#104#return; 1996#L61-1 assume true; 2017#func_to_recursive_line_25_to_26_0EXIT >#98#return; 2007#L87-1 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; 1987#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1992#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#4(~b.base, ~b.offset, 4); 1986#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1990#L81-1 assume true; 2012#func_to_recursive_line_24_to_25_0EXIT >#100#return; 2013#L81-1 assume true; 2016#func_to_recursive_line_24_to_25_0EXIT >#112#return; 1981#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 1982#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 2005#$Ultimate##0 [2024-10-15 00:58:20,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:58:20,309 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 7 times [2024-10-15 00:58:20,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:58:20,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688575960] [2024-10-15 00:58:20,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:58:20,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:58:20,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:58:20,318 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:58:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:58:20,323 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:58:20,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:58:20,324 INFO L85 PathProgramCache]: Analyzing trace with hash -12329689, now seen corresponding path program 3 times [2024-10-15 00:58:20,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:58:20,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137898807] [2024-10-15 00:58:20,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:58:20,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:58:20,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:20,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:20,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:21,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:21,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:21,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:21,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:22,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:22,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:22,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:22,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:22,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:22,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:22,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:22,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-15 00:58:22,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:22,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:22,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:22,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:22,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:22,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:22,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:22,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-15 00:58:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:22,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:22,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:22,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:22,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:22,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-15 00:58:22,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:22,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-15 00:58:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:22,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-15 00:58:22,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:22,710 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 10 proven. 135 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2024-10-15 00:58:22,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:58:22,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137898807] [2024-10-15 00:58:22,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137898807] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:58:22,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586225438] [2024-10-15 00:58:22,711 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-15 00:58:22,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:58:22,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:58:22,713 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-10-15 00:58:22,716 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-10-15 00:58:22,823 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-15 00:58:22,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:58:22,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-15 00:58:22,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:58:22,834 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-10-15 00:58:23,008 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-10-15 00:58:23,008 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:58:23,672 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2024-10-15 00:58:23,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586225438] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:58:23,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:58:23,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 10] total 29 [2024-10-15 00:58:23,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80841814] [2024-10-15 00:58:23,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:58:23,673 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:58:23,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:58:23,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-15 00:58:23,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=705, Unknown=0, NotChecked=0, Total=812 [2024-10-15 00:58:23,675 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. cyclomatic complexity: 13 Second operand has 29 states, 23 states have (on average 2.391304347826087) internal successors, (55), 22 states have internal predecessors, (55), 10 states have call successors, (23), 9 states have call predecessors, (23), 10 states have return successors, (21), 9 states have call predecessors, (21), 10 states have call successors, (21) [2024-10-15 00:58:24,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:58:24,270 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2024-10-15 00:58:24,270 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 62 transitions. [2024-10-15 00:58:24,271 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-15 00:58:24,272 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 62 transitions. [2024-10-15 00:58:24,272 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2024-10-15 00:58:24,272 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2024-10-15 00:58:24,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 62 transitions. [2024-10-15 00:58:24,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:58:24,273 INFO L218 hiAutomatonCegarLoop]: Abstraction has 54 states and 62 transitions. [2024-10-15 00:58:24,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 62 transitions. [2024-10-15 00:58:24,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-15 00:58:24,276 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-10-15 00:58:24,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2024-10-15 00:58:24,276 INFO L240 hiAutomatonCegarLoop]: Abstraction has 54 states and 62 transitions. [2024-10-15 00:58:24,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-15 00:58:24,277 INFO L425 stractBuchiCegarLoop]: Abstraction has 54 states and 62 transitions. [2024-10-15 00:58:24,277 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-15 00:58:24,277 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 62 transitions. [2024-10-15 00:58:24,278 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-15 00:58:24,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:58:24,278 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:58:24,281 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-15 00:58:24,282 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [30, 30, 24, 24, 24, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:58:24,282 INFO L745 eck$LassoCheckResult]: Stem: 3339#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 3319#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 3308#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 3330#$Ultimate##0 [2024-10-15 00:58:24,282 INFO L747 eck$LassoCheckResult]: Loop: 3330#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 3317#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(0, ~b.base, ~b.offset, 4); 3313#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3318#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#4(~b.base, ~b.offset, 4); 3312#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~c.base, ~c.offset, 4); 3315#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3332#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 3337#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 3326#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3324#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 3327#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 3304#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 3311#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3335#L25-1 assume true; 3323#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3303#L25-1 assume true; 3306#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3353#L25-1 assume true; 3352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3349#L25-1 assume true; 3348#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3346#L25-1 assume true; 3345#func_to_recursive_line_27_to_27_0EXIT >#108#return; 3342#L47-1 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; 3325#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3324#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 3327#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 3304#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 3311#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3335#L25-1 assume true; 3323#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3303#L25-1 assume true; 3306#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3353#L25-1 assume true; 3352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3349#L25-1 assume true; 3348#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3346#L25-1 assume true; 3345#func_to_recursive_line_27_to_27_0EXIT >#108#return; 3342#L47-1 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; 3325#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3324#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 3327#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 3304#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 3311#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3335#L25-1 assume true; 3323#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3303#L25-1 assume true; 3306#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3353#L25-1 assume true; 3352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3349#L25-1 assume true; 3348#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3346#L25-1 assume true; 3345#func_to_recursive_line_27_to_27_0EXIT >#108#return; 3342#L47-1 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; 3325#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3324#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 3327#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3331#L41-1 assume true; 3328#func_to_recursive_line_26_to_27_0EXIT >#110#return; 3329#L41-1 assume true; 3356#func_to_recursive_line_26_to_27_0EXIT >#110#return; 3355#L41-1 assume true; 3354#func_to_recursive_line_26_to_27_0EXIT >#110#return; 3351#L41-1 assume true; 3350#func_to_recursive_line_26_to_27_0EXIT >#102#return; 3334#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 3321#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3332#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 3337#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 3338#L61-1 assume true; 3320#func_to_recursive_line_25_to_26_0EXIT >#104#return; 3322#L61-1 assume true; 3336#func_to_recursive_line_25_to_26_0EXIT >#98#return; 3333#L87-1 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; 3314#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3318#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#4(~b.base, ~b.offset, 4); 3312#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~c.base, ~c.offset, 4); 3315#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3332#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 3337#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 3326#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3324#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 3327#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 3304#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 3311#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3335#L25-1 assume true; 3323#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3303#L25-1 assume true; 3306#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3353#L25-1 assume true; 3352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3349#L25-1 assume true; 3348#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3346#L25-1 assume true; 3345#func_to_recursive_line_27_to_27_0EXIT >#108#return; 3342#L47-1 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; 3325#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3324#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 3327#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 3304#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 3311#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3335#L25-1 assume true; 3323#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3303#L25-1 assume true; 3306#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3353#L25-1 assume true; 3352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3349#L25-1 assume true; 3348#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3346#L25-1 assume true; 3345#func_to_recursive_line_27_to_27_0EXIT >#108#return; 3342#L47-1 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; 3325#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3324#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 3327#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 3304#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 3311#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3310#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 3311#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3335#L25-1 assume true; 3323#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3303#L25-1 assume true; 3306#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3353#L25-1 assume true; 3352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3349#L25-1 assume true; 3348#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3346#L25-1 assume true; 3345#func_to_recursive_line_27_to_27_0EXIT >#108#return; 3342#L47-1 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; 3325#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3324#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 3327#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3331#L41-1 assume true; 3328#func_to_recursive_line_26_to_27_0EXIT >#110#return; 3329#L41-1 assume true; 3356#func_to_recursive_line_26_to_27_0EXIT >#110#return; 3355#L41-1 assume true; 3354#func_to_recursive_line_26_to_27_0EXIT >#110#return; 3351#L41-1 assume true; 3350#func_to_recursive_line_26_to_27_0EXIT >#102#return; 3334#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 3321#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3332#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 3337#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 3338#L61-1 assume true; 3320#func_to_recursive_line_25_to_26_0EXIT >#104#return; 3322#L61-1 assume true; 3336#func_to_recursive_line_25_to_26_0EXIT >#98#return; 3333#L87-1 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; 3314#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3318#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#4(~b.base, ~b.offset, 4); 3312#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 3316#L81-1 assume true; 3340#func_to_recursive_line_24_to_25_0EXIT >#100#return; 3341#L81-1 assume true; 3347#func_to_recursive_line_24_to_25_0EXIT >#100#return; 3344#L81-1 assume true; 3343#func_to_recursive_line_24_to_25_0EXIT >#112#return; 3307#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 3309#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 3330#$Ultimate##0 [2024-10-15 00:58:24,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:58:24,283 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 8 times [2024-10-15 00:58:24,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:58:24,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508952504] [2024-10-15 00:58:24,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:58:24,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:58:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:58:24,296 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:58:24,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:58:24,302 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:58:24,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:58:24,303 INFO L85 PathProgramCache]: Analyzing trace with hash -501444433, now seen corresponding path program 4 times [2024-10-15 00:58:24,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:58:24,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435381964] [2024-10-15 00:58:24,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:58:24,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:58:24,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:25,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:26,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:26,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:26,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:26,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:26,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:26,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:26,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:26,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:26,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:26,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:26,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:26,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 00:58:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:26,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:26,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:26,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:26,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:26,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:26,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:26,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:26,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:26,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:26,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 00:58:26,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:26,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:26,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:26,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:26,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:26,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:26,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:26,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:26,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:26,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:26,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:26,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 00:58:26,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:26,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-15 00:58:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:26,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-15 00:58:26,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:26,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:26,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:26,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:26,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:26,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:26,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:26,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:26,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:26,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:26,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:26,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:26,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:26,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:26,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 00:58:27,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:27,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:27,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:27,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:27,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:27,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:27,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:27,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 00:58:27,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:27,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:27,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:27,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:27,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:27,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:27,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:27,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:27,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 00:58:27,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:27,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-15 00:58:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:27,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-15 00:58:27,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:27,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2215 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 2190 trivial. 0 not checked. [2024-10-15 00:58:27,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:58:27,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435381964] [2024-10-15 00:58:27,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435381964] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:58:27,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532075219] [2024-10-15 00:58:27,097 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-15 00:58:27,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:58:27,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:58:27,099 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-10-15 00:58:27,101 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-10-15 00:58:27,406 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-15 00:58:27,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:58:27,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 1532 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-15 00:58:27,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:58:27,432 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-10-15 00:58:27,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2215 backedges. 114 proven. 15 refuted. 0 times theorem prover too weak. 2086 trivial. 0 not checked. [2024-10-15 00:58:27,673 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:58:29,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2215 backedges. 106 proven. 33 refuted. 0 times theorem prover too weak. 2076 trivial. 0 not checked. [2024-10-15 00:58:29,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532075219] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:58:29,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:58:29,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 18] total 37 [2024-10-15 00:58:29,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591944732] [2024-10-15 00:58:29,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:58:29,421 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:58:29,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:58:29,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-15 00:58:29,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1133, Unknown=0, NotChecked=0, Total=1332 [2024-10-15 00:58:29,422 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. cyclomatic complexity: 13 Second operand has 37 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 28 states have internal predecessors, (68), 15 states have call successors, (35), 11 states have call predecessors, (35), 12 states have return successors, (29), 14 states have call predecessors, (29), 15 states have call successors, (29) [2024-10-15 00:58:29,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:58:29,920 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2024-10-15 00:58:29,920 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 66 transitions. [2024-10-15 00:58:29,921 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-15 00:58:29,922 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 66 transitions. [2024-10-15 00:58:29,922 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2024-10-15 00:58:29,922 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2024-10-15 00:58:29,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 66 transitions. [2024-10-15 00:58:29,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:58:29,923 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 66 transitions. [2024-10-15 00:58:29,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 66 transitions. [2024-10-15 00:58:29,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-10-15 00:58:29,925 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-10-15 00:58:29,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2024-10-15 00:58:29,926 INFO L240 hiAutomatonCegarLoop]: Abstraction has 58 states and 66 transitions. [2024-10-15 00:58:29,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-15 00:58:29,927 INFO L425 stractBuchiCegarLoop]: Abstraction has 58 states and 66 transitions. [2024-10-15 00:58:29,927 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-15 00:58:29,927 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 66 transitions. [2024-10-15 00:58:29,927 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-15 00:58:29,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:58:29,928 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:58:29,932 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-15 00:58:29,932 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [80, 80, 64, 64, 64, 20, 20, 16, 16, 16, 16, 16, 16, 16, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:58:29,932 INFO L745 eck$LassoCheckResult]: Stem: 6340#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 6320#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 6309#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 6331#$Ultimate##0 [2024-10-15 00:58:29,933 INFO L747 eck$LassoCheckResult]: Loop: 6331#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 6318#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(0, ~b.base, ~b.offset, 4); 6315#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 6319#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#4(~b.base, ~b.offset, 4); 6313#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~c.base, ~c.offset, 4); 6316#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 6333#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 6337#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 6327#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 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; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 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; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 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; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 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; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 6328#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6332#L41-1 assume true; 6329#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6330#L41-1 assume true; 6361#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6360#L41-1 assume true; 6359#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6358#L41-1 assume true; 6357#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6356#L41-1 assume true; 6355#func_to_recursive_line_26_to_27_0EXIT >#102#return; 6335#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 6323#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 6333#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 6337#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 6327#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 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; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 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; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 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; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 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; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 6328#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6332#L41-1 assume true; 6329#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6330#L41-1 assume true; 6361#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6360#L41-1 assume true; 6359#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6358#L41-1 assume true; 6357#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6356#L41-1 assume true; 6355#func_to_recursive_line_26_to_27_0EXIT >#102#return; 6335#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 6323#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 6333#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 6337#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 6336#L61-1 assume true; 6322#func_to_recursive_line_25_to_26_0EXIT >#104#return; 6324#L61-1 assume true; 6349#func_to_recursive_line_25_to_26_0EXIT >#104#return; 6345#L61-1 assume true; 6344#func_to_recursive_line_25_to_26_0EXIT >#98#return; 6334#L87-1 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; 6314#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 6319#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#4(~b.base, ~b.offset, 4); 6313#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~c.base, ~c.offset, 4); 6316#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 6333#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 6337#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 6327#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 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; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 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; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 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; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 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; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 6328#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6332#L41-1 assume true; 6329#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6330#L41-1 assume true; 6361#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6360#L41-1 assume true; 6359#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6358#L41-1 assume true; 6357#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6356#L41-1 assume true; 6355#func_to_recursive_line_26_to_27_0EXIT >#102#return; 6335#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 6323#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 6333#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 6337#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 6327#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 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; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 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; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 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; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 6328#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 6306#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 6305#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 6311#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 6312#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6304#L25-1 assume true; 6307#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6321#L25-1 assume true; 6354#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6353#L25-1 assume true; 6352#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6351#L25-1 assume true; 6350#func_to_recursive_line_27_to_27_0EXIT >#106#return; 6347#L25-1 assume true; 6346#func_to_recursive_line_27_to_27_0EXIT >#108#return; 6341#L47-1 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; 6326#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 6325#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 6328#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6332#L41-1 assume true; 6329#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6330#L41-1 assume true; 6361#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6360#L41-1 assume true; 6359#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6358#L41-1 assume true; 6357#func_to_recursive_line_26_to_27_0EXIT >#110#return; 6356#L41-1 assume true; 6355#func_to_recursive_line_26_to_27_0EXIT >#102#return; 6335#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 6323#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 6333#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 6337#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 6336#L61-1 assume true; 6322#func_to_recursive_line_25_to_26_0EXIT >#104#return; 6324#L61-1 assume true; 6349#func_to_recursive_line_25_to_26_0EXIT >#104#return; 6345#L61-1 assume true; 6344#func_to_recursive_line_25_to_26_0EXIT >#98#return; 6334#L87-1 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; 6314#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 6319#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#4(~b.base, ~b.offset, 4); 6313#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 6317#L81-1 assume true; 6338#func_to_recursive_line_24_to_25_0EXIT >#100#return; 6339#L81-1 assume true; 6348#func_to_recursive_line_24_to_25_0EXIT >#100#return; 6343#L81-1 assume true; 6342#func_to_recursive_line_24_to_25_0EXIT >#112#return; 6308#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 6310#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 6331#$Ultimate##0 [2024-10-15 00:58:29,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:58:29,934 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 9 times [2024-10-15 00:58:29,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:58:29,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535990949] [2024-10-15 00:58:29,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:58:29,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:58:29,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:58:29,943 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:58:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:58:29,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:58:29,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:58:29,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1995563505, now seen corresponding path program 5 times [2024-10-15 00:58:29,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:58:29,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737785434] [2024-10-15 00:58:29,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:58:29,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:58:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:33,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:33,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:36,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:36,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:37,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:38,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:38,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:38,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:38,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:38,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:38,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:38,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:38,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:38,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:38,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 00:58:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:38,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:38,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:38,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:38,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:38,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:38,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:38,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:38,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:38,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 00:58:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:38,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:38,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:38,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:38,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:38,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:38,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:38,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:38,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:38,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:38,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 00:58:38,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:38,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:38,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:38,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:38,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:38,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:38,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:38,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:38,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 00:58:38,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:38,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-15 00:58:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:38,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 00:58:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 00:58:39,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 00:58:39,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 00:58:39,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-15 00:58:39,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2024-10-15 00:58:39,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 00:58:39,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 00:58:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 00:58:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 00:58:39,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-15 00:58:39,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 00:58:39,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 00:58:39,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 00:58:39,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:39,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 00:58:39,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-15 00:58:39,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2024-10-15 00:58:39,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:39,719 INFO L134 CoverageAnalysis]: Checked inductivity of 15869 backedges. 22 proven. 1478 refuted. 0 times theorem prover too weak. 14369 trivial. 0 not checked. [2024-10-15 00:58:39,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:58:39,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737785434] [2024-10-15 00:58:39,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737785434] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:58:39,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229615844] [2024-10-15 00:58:39,719 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-15 00:58:39,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:58:39,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:58:39,721 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-10-15 00:58:39,722 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-10-15 00:58:46,046 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2024-10-15 00:58:46,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:58:46,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 1697 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-10-15 00:58:46,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:58:46,084 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-10-15 00:58:46,385 INFO L134 CoverageAnalysis]: Checked inductivity of 15869 backedges. 3513 proven. 24 refuted. 0 times theorem prover too weak. 12332 trivial. 0 not checked. [2024-10-15 00:58:46,386 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:58:50,027 INFO L134 CoverageAnalysis]: Checked inductivity of 15869 backedges. 139 proven. 1786 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2024-10-15 00:58:50,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229615844] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:58:50,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:58:50,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 22] total 41 [2024-10-15 00:58:50,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335264477] [2024-10-15 00:58:50,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:58:50,029 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:58:50,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:58:50,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-15 00:58:50,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=1345, Unknown=0, NotChecked=0, Total=1640 [2024-10-15 00:58:50,030 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. cyclomatic complexity: 13 Second operand has 41 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 32 states have internal predecessors, (78), 12 states have call successors, (40), 11 states have call predecessors, (40), 13 states have return successors, (36), 11 states have call predecessors, (36), 12 states have call successors, (36) [2024-10-15 00:58:50,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:58:50,510 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2024-10-15 00:58:50,510 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 70 transitions. [2024-10-15 00:58:50,511 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-15 00:58:50,515 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 62 states and 70 transitions. [2024-10-15 00:58:50,515 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2024-10-15 00:58:50,515 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2024-10-15 00:58:50,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 70 transitions. [2024-10-15 00:58:50,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:58:50,515 INFO L218 hiAutomatonCegarLoop]: Abstraction has 62 states and 70 transitions. [2024-10-15 00:58:50,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 70 transitions. [2024-10-15 00:58:50,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-15 00:58:50,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 38 states have internal predecessors, (38), 10 states have call successors, (10), 5 states have call predecessors, (10), 18 states have return successors, (22), 18 states have call predecessors, (22), 8 states have call successors, (22) [2024-10-15 00:58:50,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2024-10-15 00:58:50,519 INFO L240 hiAutomatonCegarLoop]: Abstraction has 62 states and 70 transitions. [2024-10-15 00:58:50,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-15 00:58:50,519 INFO L425 stractBuchiCegarLoop]: Abstraction has 62 states and 70 transitions. [2024-10-15 00:58:50,519 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-15 00:58:50,519 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 70 transitions. [2024-10-15 00:58:50,520 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-15 00:58:50,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:58:50,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:58:50,524 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-15 00:58:50,524 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [112, 112, 96, 96, 96, 20, 20, 16, 16, 16, 16, 16, 16, 16, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:58:50,524 INFO L745 eck$LassoCheckResult]: Stem: 14067#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 14049#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 14039#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 14060#$Ultimate##0 [2024-10-15 00:58:50,525 INFO L747 eck$LassoCheckResult]: Loop: 14060#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 14047#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(0, ~b.base, ~b.offset, 4); 14043#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 14048#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#4(~b.base, ~b.offset, 4); 14042#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~c.base, ~c.offset, 4); 14045#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 14062#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 14066#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 14055#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14054#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 14057#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 14035#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14033#L25-1 assume true; 14036#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14053#L25-1 assume true; 14089#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14088#L25-1 assume true; 14085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14084#L25-1 assume true; 14083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14082#L25-1 assume true; 14081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14080#L25-1 assume true; 14079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14076#L25-1 assume true; 14075#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14070#L47-1 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; 14056#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14054#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 14057#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 14035#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14033#L25-1 assume true; 14036#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14053#L25-1 assume true; 14089#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14088#L25-1 assume true; 14085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14084#L25-1 assume true; 14083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14082#L25-1 assume true; 14081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14080#L25-1 assume true; 14079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14076#L25-1 assume true; 14075#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14070#L47-1 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; 14056#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14054#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 14057#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 14035#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14033#L25-1 assume true; 14036#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14053#L25-1 assume true; 14089#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14088#L25-1 assume true; 14085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14084#L25-1 assume true; 14083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14082#L25-1 assume true; 14081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14080#L25-1 assume true; 14079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14076#L25-1 assume true; 14075#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14070#L47-1 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; 14056#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14054#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 14057#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 14035#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14033#L25-1 assume true; 14036#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14053#L25-1 assume true; 14089#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14088#L25-1 assume true; 14085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14084#L25-1 assume true; 14083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14082#L25-1 assume true; 14081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14080#L25-1 assume true; 14079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14076#L25-1 assume true; 14075#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14070#L47-1 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; 14056#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14054#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 14057#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 14061#L41-1 assume true; 14058#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14059#L41-1 assume true; 14094#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14093#L41-1 assume true; 14092#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14091#L41-1 assume true; 14090#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14087#L41-1 assume true; 14086#func_to_recursive_line_26_to_27_0EXIT >#102#return; 14064#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 14051#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 14062#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 14066#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 14055#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14054#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 14057#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 14035#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14033#L25-1 assume true; 14036#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14053#L25-1 assume true; 14089#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14088#L25-1 assume true; 14085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14084#L25-1 assume true; 14083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14082#L25-1 assume true; 14081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14080#L25-1 assume true; 14079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14076#L25-1 assume true; 14075#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14070#L47-1 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; 14056#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14054#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 14057#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 14035#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14033#L25-1 assume true; 14036#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14053#L25-1 assume true; 14089#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14088#L25-1 assume true; 14085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14084#L25-1 assume true; 14083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14082#L25-1 assume true; 14081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14080#L25-1 assume true; 14079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14076#L25-1 assume true; 14075#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14070#L47-1 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; 14056#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14054#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 14057#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 14035#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14033#L25-1 assume true; 14036#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14053#L25-1 assume true; 14089#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14088#L25-1 assume true; 14085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14084#L25-1 assume true; 14083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14082#L25-1 assume true; 14081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14080#L25-1 assume true; 14079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14076#L25-1 assume true; 14075#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14070#L47-1 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; 14056#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14054#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 14057#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 14035#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14033#L25-1 assume true; 14036#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14053#L25-1 assume true; 14089#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14088#L25-1 assume true; 14085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14084#L25-1 assume true; 14083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14082#L25-1 assume true; 14081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14080#L25-1 assume true; 14079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14076#L25-1 assume true; 14075#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14070#L47-1 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; 14056#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14054#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 14057#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 14061#L41-1 assume true; 14058#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14059#L41-1 assume true; 14094#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14093#L41-1 assume true; 14092#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14091#L41-1 assume true; 14090#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14087#L41-1 assume true; 14086#func_to_recursive_line_26_to_27_0EXIT >#102#return; 14064#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 14051#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 14062#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 14066#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 14065#L61-1 assume true; 14050#func_to_recursive_line_25_to_26_0EXIT >#104#return; 14052#L61-1 assume true; 14078#func_to_recursive_line_25_to_26_0EXIT >#104#return; 14074#L61-1 assume true; 14073#func_to_recursive_line_25_to_26_0EXIT >#98#return; 14063#L87-1 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; 14044#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 14048#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#4(~b.base, ~b.offset, 4); 14042#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~c.base, ~c.offset, 4); 14045#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 14062#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 14066#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 14055#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14054#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 14057#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 14035#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14033#L25-1 assume true; 14036#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14053#L25-1 assume true; 14089#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14088#L25-1 assume true; 14085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14084#L25-1 assume true; 14083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14082#L25-1 assume true; 14081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14080#L25-1 assume true; 14079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14076#L25-1 assume true; 14075#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14070#L47-1 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; 14056#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14054#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 14057#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 14035#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14033#L25-1 assume true; 14036#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14053#L25-1 assume true; 14089#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14088#L25-1 assume true; 14085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14084#L25-1 assume true; 14083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14082#L25-1 assume true; 14081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14080#L25-1 assume true; 14079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14076#L25-1 assume true; 14075#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14070#L47-1 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; 14056#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14054#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 14057#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 14035#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14033#L25-1 assume true; 14036#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14053#L25-1 assume true; 14089#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14088#L25-1 assume true; 14085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14084#L25-1 assume true; 14083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14082#L25-1 assume true; 14081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14080#L25-1 assume true; 14079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14076#L25-1 assume true; 14075#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14070#L47-1 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; 14056#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14054#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 14057#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 14035#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14033#L25-1 assume true; 14036#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14053#L25-1 assume true; 14089#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14088#L25-1 assume true; 14085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14084#L25-1 assume true; 14083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14082#L25-1 assume true; 14081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14080#L25-1 assume true; 14079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14076#L25-1 assume true; 14075#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14070#L47-1 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; 14056#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14054#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 14057#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 14061#L41-1 assume true; 14058#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14059#L41-1 assume true; 14094#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14093#L41-1 assume true; 14092#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14091#L41-1 assume true; 14090#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14087#L41-1 assume true; 14086#func_to_recursive_line_26_to_27_0EXIT >#102#return; 14064#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 14051#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 14062#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 14066#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 14055#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14054#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 14057#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 14035#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14033#L25-1 assume true; 14036#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14053#L25-1 assume true; 14089#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14088#L25-1 assume true; 14085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14084#L25-1 assume true; 14083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14082#L25-1 assume true; 14081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14080#L25-1 assume true; 14079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14076#L25-1 assume true; 14075#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14070#L47-1 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; 14056#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14054#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 14057#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 14035#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14033#L25-1 assume true; 14036#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14053#L25-1 assume true; 14089#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14088#L25-1 assume true; 14085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14084#L25-1 assume true; 14083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14082#L25-1 assume true; 14081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14080#L25-1 assume true; 14079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14076#L25-1 assume true; 14075#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14070#L47-1 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; 14056#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14054#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 14057#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 14035#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14033#L25-1 assume true; 14036#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14053#L25-1 assume true; 14089#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14088#L25-1 assume true; 14085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14084#L25-1 assume true; 14083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14082#L25-1 assume true; 14081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14080#L25-1 assume true; 14079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14076#L25-1 assume true; 14075#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14070#L47-1 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; 14056#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14054#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 14057#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 14035#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 14034#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 14040#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 14041#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 14033#L25-1 assume true; 14036#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14053#L25-1 assume true; 14089#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14088#L25-1 assume true; 14085#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14084#L25-1 assume true; 14083#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14082#L25-1 assume true; 14081#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14080#L25-1 assume true; 14079#func_to_recursive_line_27_to_27_0EXIT >#106#return; 14076#L25-1 assume true; 14075#func_to_recursive_line_27_to_27_0EXIT >#108#return; 14070#L47-1 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; 14056#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 14054#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 14057#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 14061#L41-1 assume true; 14058#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14059#L41-1 assume true; 14094#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14093#L41-1 assume true; 14092#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14091#L41-1 assume true; 14090#func_to_recursive_line_26_to_27_0EXIT >#110#return; 14087#L41-1 assume true; 14086#func_to_recursive_line_26_to_27_0EXIT >#102#return; 14064#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 14051#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 14062#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 14066#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 14065#L61-1 assume true; 14050#func_to_recursive_line_25_to_26_0EXIT >#104#return; 14052#L61-1 assume true; 14078#func_to_recursive_line_25_to_26_0EXIT >#104#return; 14074#L61-1 assume true; 14073#func_to_recursive_line_25_to_26_0EXIT >#98#return; 14063#L87-1 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; 14044#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 14048#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#4(~b.base, ~b.offset, 4); 14042#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 14046#L81-1 assume true; 14068#func_to_recursive_line_24_to_25_0EXIT >#100#return; 14069#L81-1 assume true; 14077#func_to_recursive_line_24_to_25_0EXIT >#100#return; 14072#L81-1 assume true; 14071#func_to_recursive_line_24_to_25_0EXIT >#112#return; 14037#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 14038#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 14060#$Ultimate##0 [2024-10-15 00:58:50,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:58:50,525 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 10 times [2024-10-15 00:58:50,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:58:50,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761927991] [2024-10-15 00:58:50,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:58:50,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:58:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:58:50,535 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:58:50,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:58:50,541 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:58:50,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:58:50,542 INFO L85 PathProgramCache]: Analyzing trace with hash -69728241, now seen corresponding path program 6 times [2024-10-15 00:58:50,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:58:50,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037163510] [2024-10-15 00:58:50,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:58:50,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:58:50,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:55,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 00:58:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 00:58:58,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 00:58:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 00:58:58,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-15 00:58:58,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 00:58:58,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 00:58:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 00:58:58,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:58:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 00:58:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-15 00:58:58,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:58:58,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2024-10-15 00:58:58,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:00,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:00,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:00,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:00,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:01,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:01,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:01,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:01,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:01,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:01,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:01,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:01,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:01,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:01,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:01,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:01,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:01,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 00:59:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:01,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:01,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:01,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:01,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:01,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:01,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:01,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:01,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:01,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:01,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:01,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:01,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:01,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:01,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:01,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 00:59:01,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:01,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:01,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:01,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:01,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:01,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:01,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:01,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:01,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:01,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:01,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:01,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:01,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 00:59:01,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:01,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:01,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:01,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:01,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:01,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:01,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:01,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:01,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:01,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:01,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:01,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:01,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:01,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:01,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 00:59:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:01,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-15 00:59:01,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:02,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:02,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:03,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:03,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:03,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:03,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:03,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:03,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:03,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:03,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:03,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:03,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:03,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:03,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:03,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:03,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:03,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 00:59:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:04,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:04,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:04,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:04,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:04,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:04,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:04,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:04,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:04,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:04,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:04,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:04,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:04,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 00:59:04,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:04,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:04,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:04,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:04,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:04,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:04,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:04,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:04,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:04,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:04,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:04,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:04,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:04,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 00:59:04,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:05,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:05,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:05,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:05,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:05,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:05,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:05,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:05,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:05,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:05,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:05,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:05,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:05,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:05,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 00:59:05,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:05,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-15 00:59:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:05,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2024-10-15 00:59:05,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:05,196 INFO L134 CoverageAnalysis]: Checked inductivity of 30637 backedges. 421 proven. 29 refuted. 0 times theorem prover too weak. 30187 trivial. 0 not checked. [2024-10-15 00:59:05,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:59:05,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037163510] [2024-10-15 00:59:05,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037163510] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:59:05,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473178196] [2024-10-15 00:59:05,197 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-15 00:59:05,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:59:05,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:59:05,202 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-10-15 00:59:05,204 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-10-15 00:59:05,682 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-10-15 00:59:05,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:59:05,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-15 00:59:05,701 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:59:05,706 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-10-15 00:59:05,938 INFO L134 CoverageAnalysis]: Checked inductivity of 30637 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 30629 trivial. 0 not checked. [2024-10-15 00:59:05,938 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:59:08,489 INFO L134 CoverageAnalysis]: Checked inductivity of 30637 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 30622 trivial. 0 not checked. [2024-10-15 00:59:08,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473178196] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:59:08,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:59:08,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 10, 14] total 43 [2024-10-15 00:59:08,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173687022] [2024-10-15 00:59:08,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:59:08,491 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-15 00:59:08,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:59:08,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-10-15 00:59:08,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1623, Unknown=0, NotChecked=0, Total=1806 [2024-10-15 00:59:08,492 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. cyclomatic complexity: 13 Second operand has 43 states, 33 states have (on average 2.090909090909091) internal successors, (69), 35 states have internal predecessors, (69), 18 states have call successors, (32), 10 states have call predecessors, (32), 14 states have return successors, (29), 17 states have call predecessors, (29), 18 states have call successors, (29) [2024-10-15 00:59:09,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:59:09,357 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2024-10-15 00:59:09,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 74 transitions. [2024-10-15 00:59:09,358 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-15 00:59:09,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 66 states and 74 transitions. [2024-10-15 00:59:09,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2024-10-15 00:59:09,359 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2024-10-15 00:59:09,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 74 transitions. [2024-10-15 00:59:09,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:59:09,360 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66 states and 74 transitions. [2024-10-15 00:59:09,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 74 transitions. [2024-10-15 00:59:09,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-15 00:59:09,362 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-10-15 00:59:09,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2024-10-15 00:59:09,363 INFO L240 hiAutomatonCegarLoop]: Abstraction has 66 states and 74 transitions. [2024-10-15 00:59:09,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-15 00:59:09,364 INFO L425 stractBuchiCegarLoop]: Abstraction has 66 states and 74 transitions. [2024-10-15 00:59:09,364 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-15 00:59:09,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 74 transitions. [2024-10-15 00:59:09,365 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2024-10-15 00:59:09,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:59:09,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:59:09,369 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-15 00:59:09,370 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [210, 210, 180, 180, 180, 36, 36, 30, 30, 30, 30, 30, 30, 30, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:59:09,370 INFO L745 eck$LassoCheckResult]: Stem: 24676#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 24655#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 24644#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 24666#$Ultimate##0 [2024-10-15 00:59:09,371 INFO L747 eck$LassoCheckResult]: Loop: 24666#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 24653#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#4(0, ~b.base, ~b.offset, 4); 24649#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 24654#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#4(~b.base, ~b.offset, 4); 24648#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~c.base, ~c.offset, 4); 24651#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 24668#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 24672#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 24661#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24660#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 24663#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 24640#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24639#L25-1 assume true; 24642#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24656#L25-1 assume true; 24695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24694#L25-1 assume true; 24693#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24692#L25-1 assume true; 24691#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24690#L25-1 assume true; 24689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24688#L25-1 assume true; 24686#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24684#L25-1 assume true; 24683#func_to_recursive_line_27_to_27_0EXIT >#108#return; 24677#L47-1 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; 24662#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24660#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 24663#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 24640#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24639#L25-1 assume true; 24642#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24656#L25-1 assume true; 24695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24694#L25-1 assume true; 24693#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24692#L25-1 assume true; 24691#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24690#L25-1 assume true; 24689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24688#L25-1 assume true; 24686#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24684#L25-1 assume true; 24683#func_to_recursive_line_27_to_27_0EXIT >#108#return; 24677#L47-1 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; 24662#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24660#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 24663#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 24640#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24639#L25-1 assume true; 24642#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24656#L25-1 assume true; 24695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24694#L25-1 assume true; 24693#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24692#L25-1 assume true; 24691#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24690#L25-1 assume true; 24689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24688#L25-1 assume true; 24686#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24684#L25-1 assume true; 24683#func_to_recursive_line_27_to_27_0EXIT >#108#return; 24677#L47-1 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; 24662#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24660#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 24663#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 24640#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24639#L25-1 assume true; 24642#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24656#L25-1 assume true; 24695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24694#L25-1 assume true; 24693#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24692#L25-1 assume true; 24691#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24690#L25-1 assume true; 24689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24688#L25-1 assume true; 24686#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24684#L25-1 assume true; 24683#func_to_recursive_line_27_to_27_0EXIT >#108#return; 24677#L47-1 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; 24662#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24660#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 24663#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 24640#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24639#L25-1 assume true; 24642#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24656#L25-1 assume true; 24695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24694#L25-1 assume true; 24693#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24692#L25-1 assume true; 24691#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24690#L25-1 assume true; 24689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24688#L25-1 assume true; 24686#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24684#L25-1 assume true; 24683#func_to_recursive_line_27_to_27_0EXIT >#108#return; 24677#L47-1 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; 24662#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24660#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 24663#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 24667#L41-1 assume true; 24664#func_to_recursive_line_26_to_27_0EXIT >#110#return; 24665#L41-1 assume true; 24704#func_to_recursive_line_26_to_27_0EXIT >#110#return; 24703#L41-1 assume true; 24702#func_to_recursive_line_26_to_27_0EXIT >#110#return; 24701#L41-1 assume true; 24700#func_to_recursive_line_26_to_27_0EXIT >#110#return; 24699#L41-1 assume true; 24698#func_to_recursive_line_26_to_27_0EXIT >#110#return; 24697#L41-1 assume true; 24696#func_to_recursive_line_26_to_27_0EXIT >#102#return; 24670#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 24658#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 24668#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 24672#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 24661#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24660#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 24663#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 24640#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24639#L25-1 assume true; 24642#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24656#L25-1 assume true; 24695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24694#L25-1 assume true; 24693#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24692#L25-1 assume true; 24691#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24690#L25-1 assume true; 24689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24688#L25-1 assume true; 24686#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24684#L25-1 assume true; 24683#func_to_recursive_line_27_to_27_0EXIT >#108#return; 24677#L47-1 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; 24662#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24660#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 24663#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 24640#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24639#L25-1 assume true; 24642#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24656#L25-1 assume true; 24695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24694#L25-1 assume true; 24693#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24692#L25-1 assume true; 24691#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24690#L25-1 assume true; 24689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24688#L25-1 assume true; 24686#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24684#L25-1 assume true; 24683#func_to_recursive_line_27_to_27_0EXIT >#108#return; 24677#L47-1 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; 24662#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24660#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 24663#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 24640#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24639#L25-1 assume true; 24642#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24656#L25-1 assume true; 24695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24694#L25-1 assume true; 24693#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24692#L25-1 assume true; 24691#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24690#L25-1 assume true; 24689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24688#L25-1 assume true; 24686#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24684#L25-1 assume true; 24683#func_to_recursive_line_27_to_27_0EXIT >#108#return; 24677#L47-1 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; 24662#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24660#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 24663#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 24640#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24639#L25-1 assume true; 24642#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24656#L25-1 assume true; 24695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24694#L25-1 assume true; 24693#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24692#L25-1 assume true; 24691#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24690#L25-1 assume true; 24689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24688#L25-1 assume true; 24686#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24684#L25-1 assume true; 24683#func_to_recursive_line_27_to_27_0EXIT >#108#return; 24677#L47-1 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; 24662#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24660#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 24663#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 24640#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24639#L25-1 assume true; 24642#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24656#L25-1 assume true; 24695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24694#L25-1 assume true; 24693#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24692#L25-1 assume true; 24691#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24690#L25-1 assume true; 24689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24688#L25-1 assume true; 24686#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24684#L25-1 assume true; 24683#func_to_recursive_line_27_to_27_0EXIT >#108#return; 24677#L47-1 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; 24662#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24660#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 24663#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 24667#L41-1 assume true; 24664#func_to_recursive_line_26_to_27_0EXIT >#110#return; 24665#L41-1 assume true; 24704#func_to_recursive_line_26_to_27_0EXIT >#110#return; 24703#L41-1 assume true; 24702#func_to_recursive_line_26_to_27_0EXIT >#110#return; 24701#L41-1 assume true; 24700#func_to_recursive_line_26_to_27_0EXIT >#110#return; 24699#L41-1 assume true; 24698#func_to_recursive_line_26_to_27_0EXIT >#110#return; 24697#L41-1 assume true; 24696#func_to_recursive_line_26_to_27_0EXIT >#102#return; 24670#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 24658#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 24668#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 24672#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 24673#L61-1 assume true; 24657#func_to_recursive_line_25_to_26_0EXIT >#104#return; 24659#L61-1 assume true; 24671#func_to_recursive_line_25_to_26_0EXIT >#104#return; 24682#L61-1 assume true; 24681#func_to_recursive_line_25_to_26_0EXIT >#98#return; 24669#L87-1 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; 24650#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 24654#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#4(~b.base, ~b.offset, 4); 24648#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~c.base, ~c.offset, 4); 24651#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 24668#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 24672#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 24661#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24660#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 24663#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 24640#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24639#L25-1 assume true; 24642#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24656#L25-1 assume true; 24695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24694#L25-1 assume true; 24693#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24692#L25-1 assume true; 24691#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24690#L25-1 assume true; 24689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24688#L25-1 assume true; 24686#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24684#L25-1 assume true; 24683#func_to_recursive_line_27_to_27_0EXIT >#108#return; 24677#L47-1 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; 24662#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24660#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 24663#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 24640#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24639#L25-1 assume true; 24642#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24656#L25-1 assume true; 24695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24694#L25-1 assume true; 24693#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24692#L25-1 assume true; 24691#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24690#L25-1 assume true; 24689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24688#L25-1 assume true; 24686#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24684#L25-1 assume true; 24683#func_to_recursive_line_27_to_27_0EXIT >#108#return; 24677#L47-1 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; 24662#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24660#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 24663#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 24640#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24639#L25-1 assume true; 24642#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24656#L25-1 assume true; 24695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24694#L25-1 assume true; 24693#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24692#L25-1 assume true; 24691#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24690#L25-1 assume true; 24689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24688#L25-1 assume true; 24686#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24684#L25-1 assume true; 24683#func_to_recursive_line_27_to_27_0EXIT >#108#return; 24677#L47-1 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; 24662#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24660#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 24663#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 24640#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24639#L25-1 assume true; 24642#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24656#L25-1 assume true; 24695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24694#L25-1 assume true; 24693#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24692#L25-1 assume true; 24691#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24690#L25-1 assume true; 24689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24688#L25-1 assume true; 24686#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24684#L25-1 assume true; 24683#func_to_recursive_line_27_to_27_0EXIT >#108#return; 24677#L47-1 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; 24662#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24660#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 24663#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 24640#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24639#L25-1 assume true; 24642#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24656#L25-1 assume true; 24695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24694#L25-1 assume true; 24693#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24692#L25-1 assume true; 24691#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24690#L25-1 assume true; 24689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24688#L25-1 assume true; 24686#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24684#L25-1 assume true; 24683#func_to_recursive_line_27_to_27_0EXIT >#108#return; 24677#L47-1 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; 24662#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24660#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 24663#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 24667#L41-1 assume true; 24664#func_to_recursive_line_26_to_27_0EXIT >#110#return; 24665#L41-1 assume true; 24704#func_to_recursive_line_26_to_27_0EXIT >#110#return; 24703#L41-1 assume true; 24702#func_to_recursive_line_26_to_27_0EXIT >#110#return; 24701#L41-1 assume true; 24700#func_to_recursive_line_26_to_27_0EXIT >#110#return; 24699#L41-1 assume true; 24698#func_to_recursive_line_26_to_27_0EXIT >#110#return; 24697#L41-1 assume true; 24696#func_to_recursive_line_26_to_27_0EXIT >#102#return; 24670#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 24658#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 24668#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 24672#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 24661#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24660#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 24663#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 24640#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24639#L25-1 assume true; 24642#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24656#L25-1 assume true; 24695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24694#L25-1 assume true; 24693#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24692#L25-1 assume true; 24691#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24690#L25-1 assume true; 24689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24688#L25-1 assume true; 24686#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24684#L25-1 assume true; 24683#func_to_recursive_line_27_to_27_0EXIT >#108#return; 24677#L47-1 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; 24662#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24660#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 24663#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 24640#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24639#L25-1 assume true; 24642#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24656#L25-1 assume true; 24695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24694#L25-1 assume true; 24693#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24692#L25-1 assume true; 24691#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24690#L25-1 assume true; 24689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24688#L25-1 assume true; 24686#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24684#L25-1 assume true; 24683#func_to_recursive_line_27_to_27_0EXIT >#108#return; 24677#L47-1 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; 24662#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24660#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 24663#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 24640#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24639#L25-1 assume true; 24642#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24656#L25-1 assume true; 24695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24694#L25-1 assume true; 24693#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24692#L25-1 assume true; 24691#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24690#L25-1 assume true; 24689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24688#L25-1 assume true; 24686#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24684#L25-1 assume true; 24683#func_to_recursive_line_27_to_27_0EXIT >#108#return; 24677#L47-1 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; 24662#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24660#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 24663#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 24640#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24639#L25-1 assume true; 24642#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24656#L25-1 assume true; 24695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24694#L25-1 assume true; 24693#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24692#L25-1 assume true; 24691#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24690#L25-1 assume true; 24689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24688#L25-1 assume true; 24686#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24684#L25-1 assume true; 24683#func_to_recursive_line_27_to_27_0EXIT >#108#return; 24677#L47-1 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; 24662#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24660#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 24663#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 24640#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24639#L25-1 assume true; 24642#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24656#L25-1 assume true; 24695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24694#L25-1 assume true; 24693#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24692#L25-1 assume true; 24691#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24690#L25-1 assume true; 24689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24688#L25-1 assume true; 24686#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24684#L25-1 assume true; 24683#func_to_recursive_line_27_to_27_0EXIT >#108#return; 24677#L47-1 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; 24662#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24660#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 24663#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 24667#L41-1 assume true; 24664#func_to_recursive_line_26_to_27_0EXIT >#110#return; 24665#L41-1 assume true; 24704#func_to_recursive_line_26_to_27_0EXIT >#110#return; 24703#L41-1 assume true; 24702#func_to_recursive_line_26_to_27_0EXIT >#110#return; 24701#L41-1 assume true; 24700#func_to_recursive_line_26_to_27_0EXIT >#110#return; 24699#L41-1 assume true; 24698#func_to_recursive_line_26_to_27_0EXIT >#110#return; 24697#L41-1 assume true; 24696#func_to_recursive_line_26_to_27_0EXIT >#102#return; 24670#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 24658#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 24668#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 24672#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 24673#L61-1 assume true; 24657#func_to_recursive_line_25_to_26_0EXIT >#104#return; 24659#L61-1 assume true; 24671#func_to_recursive_line_25_to_26_0EXIT >#104#return; 24682#L61-1 assume true; 24681#func_to_recursive_line_25_to_26_0EXIT >#98#return; 24669#L87-1 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; 24650#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 24654#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#4(~b.base, ~b.offset, 4); 24648#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~c.base, ~c.offset, 4); 24651#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 24668#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 24672#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 24661#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24660#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 24663#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 24640#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24639#L25-1 assume true; 24642#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24656#L25-1 assume true; 24695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24694#L25-1 assume true; 24693#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24692#L25-1 assume true; 24691#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24690#L25-1 assume true; 24689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24688#L25-1 assume true; 24686#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24684#L25-1 assume true; 24683#func_to_recursive_line_27_to_27_0EXIT >#108#return; 24677#L47-1 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; 24662#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24660#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 24663#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 24640#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24639#L25-1 assume true; 24642#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24656#L25-1 assume true; 24695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24694#L25-1 assume true; 24693#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24692#L25-1 assume true; 24691#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24690#L25-1 assume true; 24689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24688#L25-1 assume true; 24686#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24684#L25-1 assume true; 24683#func_to_recursive_line_27_to_27_0EXIT >#108#return; 24677#L47-1 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; 24662#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24660#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 24663#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 24640#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24639#L25-1 assume true; 24642#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24656#L25-1 assume true; 24695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24694#L25-1 assume true; 24693#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24692#L25-1 assume true; 24691#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24690#L25-1 assume true; 24689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24688#L25-1 assume true; 24686#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24684#L25-1 assume true; 24683#func_to_recursive_line_27_to_27_0EXIT >#108#return; 24677#L47-1 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; 24662#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24660#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 24663#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 24640#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24639#L25-1 assume true; 24642#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24656#L25-1 assume true; 24695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24694#L25-1 assume true; 24693#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24692#L25-1 assume true; 24691#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24690#L25-1 assume true; 24689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24688#L25-1 assume true; 24686#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24684#L25-1 assume true; 24683#func_to_recursive_line_27_to_27_0EXIT >#108#return; 24677#L47-1 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; 24662#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24660#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 24663#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 24640#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24639#L25-1 assume true; 24642#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24656#L25-1 assume true; 24695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24694#L25-1 assume true; 24693#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24692#L25-1 assume true; 24691#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24690#L25-1 assume true; 24689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24688#L25-1 assume true; 24686#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24684#L25-1 assume true; 24683#func_to_recursive_line_27_to_27_0EXIT >#108#return; 24677#L47-1 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; 24662#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24660#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 24663#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 24667#L41-1 assume true; 24664#func_to_recursive_line_26_to_27_0EXIT >#110#return; 24665#L41-1 assume true; 24704#func_to_recursive_line_26_to_27_0EXIT >#110#return; 24703#L41-1 assume true; 24702#func_to_recursive_line_26_to_27_0EXIT >#110#return; 24701#L41-1 assume true; 24700#func_to_recursive_line_26_to_27_0EXIT >#110#return; 24699#L41-1 assume true; 24698#func_to_recursive_line_26_to_27_0EXIT >#110#return; 24697#L41-1 assume true; 24696#func_to_recursive_line_26_to_27_0EXIT >#102#return; 24670#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 24658#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 24668#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 24672#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 24661#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24660#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 24663#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 24640#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24639#L25-1 assume true; 24642#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24656#L25-1 assume true; 24695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24694#L25-1 assume true; 24693#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24692#L25-1 assume true; 24691#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24690#L25-1 assume true; 24689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24688#L25-1 assume true; 24686#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24684#L25-1 assume true; 24683#func_to_recursive_line_27_to_27_0EXIT >#108#return; 24677#L47-1 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; 24662#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24660#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 24663#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 24640#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24639#L25-1 assume true; 24642#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24656#L25-1 assume true; 24695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24694#L25-1 assume true; 24693#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24692#L25-1 assume true; 24691#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24690#L25-1 assume true; 24689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24688#L25-1 assume true; 24686#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24684#L25-1 assume true; 24683#func_to_recursive_line_27_to_27_0EXIT >#108#return; 24677#L47-1 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; 24662#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24660#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 24663#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 24640#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24639#L25-1 assume true; 24642#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24656#L25-1 assume true; 24695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24694#L25-1 assume true; 24693#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24692#L25-1 assume true; 24691#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24690#L25-1 assume true; 24689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24688#L25-1 assume true; 24686#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24684#L25-1 assume true; 24683#func_to_recursive_line_27_to_27_0EXIT >#108#return; 24677#L47-1 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; 24662#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24660#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 24663#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 24640#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24639#L25-1 assume true; 24642#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24656#L25-1 assume true; 24695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24694#L25-1 assume true; 24693#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24692#L25-1 assume true; 24691#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24690#L25-1 assume true; 24689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24688#L25-1 assume true; 24686#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24684#L25-1 assume true; 24683#func_to_recursive_line_27_to_27_0EXIT >#108#return; 24677#L47-1 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; 24662#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24660#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 24663#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~e.base, ~e.offset, 4); 24640#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 24641#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 24646#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#1(~e.base, ~e.offset, 4); 24647#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 24639#L25-1 assume true; 24642#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24656#L25-1 assume true; 24695#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24694#L25-1 assume true; 24693#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24692#L25-1 assume true; 24691#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24690#L25-1 assume true; 24689#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24688#L25-1 assume true; 24686#func_to_recursive_line_27_to_27_0EXIT >#106#return; 24684#L25-1 assume true; 24683#func_to_recursive_line_27_to_27_0EXIT >#108#return; 24677#L47-1 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; 24662#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 24660#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 24663#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 24667#L41-1 assume true; 24664#func_to_recursive_line_26_to_27_0EXIT >#110#return; 24665#L41-1 assume true; 24704#func_to_recursive_line_26_to_27_0EXIT >#110#return; 24703#L41-1 assume true; 24702#func_to_recursive_line_26_to_27_0EXIT >#110#return; 24701#L41-1 assume true; 24700#func_to_recursive_line_26_to_27_0EXIT >#110#return; 24699#L41-1 assume true; 24698#func_to_recursive_line_26_to_27_0EXIT >#110#return; 24697#L41-1 assume true; 24696#func_to_recursive_line_26_to_27_0EXIT >#102#return; 24670#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 24658#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 24668#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 24672#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 24673#L61-1 assume true; 24657#func_to_recursive_line_25_to_26_0EXIT >#104#return; 24659#L61-1 assume true; 24671#func_to_recursive_line_25_to_26_0EXIT >#104#return; 24682#L61-1 assume true; 24681#func_to_recursive_line_25_to_26_0EXIT >#98#return; 24669#L87-1 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; 24650#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 24654#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#4(~b.base, ~b.offset, 4); 24648#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 24652#L81-1 assume true; 24674#func_to_recursive_line_24_to_25_0EXIT >#100#return; 24675#L81-1 assume true; 24678#func_to_recursive_line_24_to_25_0EXIT >#100#return; 24687#L81-1 assume true; 24685#func_to_recursive_line_24_to_25_0EXIT >#100#return; 24680#L81-1 assume true; 24679#func_to_recursive_line_24_to_25_0EXIT >#112#return; 24643#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 24645#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 24666#$Ultimate##0 [2024-10-15 00:59:09,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:59:09,372 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 11 times [2024-10-15 00:59:09,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:59:09,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640015706] [2024-10-15 00:59:09,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:59:09,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:59:09,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:59:09,383 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:59:09,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:59:09,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:59:09,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:59:09,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1029105046, now seen corresponding path program 7 times [2024-10-15 00:59:09,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:59:09,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494480289] [2024-10-15 00:59:09,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:59:09,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:59:09,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:22,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 00:59:27,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 00:59:27,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 00:59:27,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 00:59:27,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 00:59:27,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-15 00:59:27,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 00:59:27,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 00:59:27,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 00:59:27,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 00:59:27,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:27,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:27,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:28,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:28,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:28,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:28,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:28,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:28,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:28,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:28,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:28,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:28,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 00:59:28,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:28,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-15 00:59:28,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:28,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 440 [2024-10-15 00:59:28,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:30,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:30,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:30,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:30,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:30,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:30,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:30,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:30,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:30,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:30,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:30,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:30,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:30,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:30,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:30,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:30,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 00:59:30,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:30,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:30,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:30,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:30,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:30,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:30,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:30,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:30,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:30,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:30,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:30,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:30,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 00:59:30,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:30,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:30,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:30,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:30,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:30,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:30,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:30,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:30,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:30,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:30,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:30,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:30,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:30,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 00:59:30,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:30,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 00:59:31,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 00:59:31,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-15 00:59:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 00:59:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 00:59:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 00:59:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 00:59:31,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:31,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 00:59:31,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-15 00:59:31,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:31,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 440 [2024-10-15 00:59:31,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:32,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:34,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:34,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:34,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:34,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:34,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:34,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:34,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:34,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:34,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:34,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:34,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:34,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:34,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:34,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 00:59:34,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:34,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:34,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:34,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:34,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:34,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:34,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:34,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:34,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:34,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:34,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:34,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:34,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:34,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 00:59:34,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:34,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:34,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:34,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:34,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:34,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:34,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:34,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:34,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:34,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:34,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:34,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:34,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:34,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:34,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 00:59:34,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:34,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:34,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:34,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:34,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:34,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:34,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:34,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:34,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:34,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:34,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:34,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:34,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:34,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:34,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 00:59:34,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:34,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:34,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:34,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:34,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:34,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:34,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:34,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:34,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:34,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:34,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:34,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:34,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:34,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 00:59:34,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:34,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-15 00:59:34,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:59:35,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 00:59:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat