./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_4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 45898d4df949634911027a72c0e1c79e1edaab63547cca5c16238cef1218e556 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-12 01:01:33,330 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 01:01:33,431 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-12 01:01:33,436 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 01:01:33,436 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 01:01:33,467 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 01:01:33,468 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 01:01:33,468 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 01:01:33,469 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 01:01:33,471 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 01:01:33,471 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 01:01:33,472 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 01:01:33,472 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 01:01:33,474 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 01:01:33,474 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 01:01:33,474 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 01:01:33,475 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 01:01:33,475 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 01:01:33,475 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 01:01:33,478 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 01:01:33,478 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 01:01:33,478 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 01:01:33,479 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 01:01:33,479 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 01:01:33,479 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 01:01:33,479 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 01:01:33,480 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 01:01:33,480 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 01:01:33,480 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 01:01:33,480 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 01:01:33,481 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 01:01:33,481 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 01:01:33,481 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 01:01:33,481 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 01:01:33,481 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 01:01:33,481 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 01:01:33,482 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 01:01:33,482 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 01:01:33,482 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 01:01:33,483 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-clean/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-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 45898d4df949634911027a72c0e1c79e1edaab63547cca5c16238cef1218e556 [2024-10-12 01:01:33,734 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 01:01:33,758 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 01:01:33,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 01:01:33,762 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 01:01:33,762 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 01:01:33,763 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c [2024-10-12 01:01:35,171 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 01:01:35,374 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 01:01:35,375 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c [2024-10-12 01:01:35,384 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f8b03927b/75b9187bf003423289c50ccf00f6e891/FLAGb632dab97 [2024-10-12 01:01:35,752 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f8b03927b/75b9187bf003423289c50ccf00f6e891 [2024-10-12 01:01:35,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 01:01:35,755 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 01:01:35,756 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 01:01:35,758 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 01:01:35,762 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 01:01:35,762 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 01:01:35" (1/1) ... [2024-10-12 01:01:35,763 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d1c36ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:01:35, skipping insertion in model container [2024-10-12 01:01:35,763 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 01:01:35" (1/1) ... [2024-10-12 01:01:35,782 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 01:01:35,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 01:01:35,986 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 01:01:36,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 01:01:36,095 INFO L204 MainTranslator]: Completed translation [2024-10-12 01:01:36,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:01:36 WrapperNode [2024-10-12 01:01:36,096 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 01:01:36,097 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 01:01:36,097 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 01:01:36,097 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 01:01:36,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:01:36" (1/1) ... [2024-10-12 01:01:36,111 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:01:36" (1/1) ... [2024-10-12 01:01:36,126 INFO L138 Inliner]: procedures = 15, calls = 52, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2024-10-12 01:01:36,126 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 01:01:36,127 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 01:01:36,127 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 01:01:36,127 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 01:01:36,137 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:01:36" (1/1) ... [2024-10-12 01:01:36,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:01:36" (1/1) ... [2024-10-12 01:01:36,143 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:01:36" (1/1) ... [2024-10-12 01:01:36,166 INFO L175 MemorySlicer]: Split 26 memory accesses to 5 slices as follows [2, 6, 6, 6, 6]. 23 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 1, 1, 1, 1]. The 8 writes are split as follows [0, 2, 2, 2, 2]. [2024-10-12 01:01:36,166 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:01:36" (1/1) ... [2024-10-12 01:01:36,166 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:01:36" (1/1) ... [2024-10-12 01:01:36,173 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:01:36" (1/1) ... [2024-10-12 01:01:36,175 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:01:36" (1/1) ... [2024-10-12 01:01:36,181 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:01:36" (1/1) ... [2024-10-12 01:01:36,183 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:01:36" (1/1) ... [2024-10-12 01:01:36,185 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 01:01:36,186 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 01:01:36,186 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 01:01:36,186 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 01:01:36,187 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:01:36" (1/1) ... [2024-10-12 01:01:36,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:01:36,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:01:36,218 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:01:36,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-12 01:01:36,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 01:01:36,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 01:01:36,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 01:01:36,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 01:01:36,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-12 01:01:36,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-12 01:01:36,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 01:01:36,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 01:01:36,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 01:01:36,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-12 01:01:36,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-12 01:01:36,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-12 01:01:36,270 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2024-10-12 01:01:36,270 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2024-10-12 01:01:36,270 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2024-10-12 01:01:36,272 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2024-10-12 01:01:36,272 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_22_to_23_0 [2024-10-12 01:01:36,272 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_22_to_23_0 [2024-10-12 01:01:36,272 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_25_0 [2024-10-12 01:01:36,272 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_25_0 [2024-10-12 01:01:36,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 01:01:36,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 01:01:36,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 01:01:36,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 01:01:36,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-12 01:01:36,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-12 01:01:36,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-12 01:01:36,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 01:01:36,356 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 01:01:36,358 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 01:01:36,606 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-12 01:01:36,607 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 01:01:36,623 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 01:01:36,623 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 01:01:36,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 01:01:36 BoogieIcfgContainer [2024-10-12 01:01:36,624 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 01:01:36,625 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 01:01:36,625 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 01:01:36,629 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 01:01:36,630 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 01:01:36,630 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 01:01:35" (1/3) ... [2024-10-12 01:01:36,631 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1775adea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 01:01:36, skipping insertion in model container [2024-10-12 01:01:36,631 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 01:01:36,631 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:01:36" (2/3) ... [2024-10-12 01:01:36,631 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1775adea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 01:01:36, skipping insertion in model container [2024-10-12 01:01:36,632 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 01:01:36,632 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 01:01:36" (3/3) ... [2024-10-12 01:01:36,633 INFO L332 chiAutomizerObserver]: Analyzing ICFG recursified_nested_4.c [2024-10-12 01:01:36,689 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 01:01:36,689 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 01:01:36,689 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 01:01:36,689 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 01:01:36,689 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 01:01:36,689 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 01:01:36,690 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 01:01:36,690 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 01:01:36,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 41 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 32 states have internal predecessors, (36), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-12 01:01:36,722 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-10-12 01:01:36,722 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:01:36,722 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:01:36,728 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-12 01:01:36,728 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:01:36,728 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 01:01:36,729 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 41 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 32 states have internal predecessors, (36), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-12 01:01:36,732 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-10-12 01:01:36,732 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:01:36,732 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:01:36,732 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-12 01:01:36,732 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:01:36,738 INFO L745 eck$LassoCheckResult]: Stem: 37#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(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#1(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#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 29#L107true call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 33#$Ultimate##0true [2024-10-12 01:01:36,738 INFO L747 eck$LassoCheckResult]: Loop: 33#$Ultimate##0true ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#2(~a.base, ~a.offset, 4); 10#L81true assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~b.base, ~b.offset, 4); 21#L87true call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 20#$Ultimate##0true ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 24#L61true assume !(#t~mem10 < 6);havoc #t~mem10; 6#L61-1true assume true; 9#func_to_recursive_line_23_to_24_0EXITtrue >#88#return; 15#L87-1true call #t~mem14 := read~int#2(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 7#L92true call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 33#$Ultimate##0true [2024-10-12 01:01:36,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:36,743 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 1 times [2024-10-12 01:01:36,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:36,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629894915] [2024-10-12 01:01:36,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:36,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:36,878 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:01:36,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:36,926 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:01:36,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:36,929 INFO L85 PathProgramCache]: Analyzing trace with hash -448633028, now seen corresponding path program 1 times [2024-10-12 01:01:36,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:36,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034384417] [2024-10-12 01:01:36,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:36,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:37,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:37,310 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-12 01:01:37,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:01:37,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034384417] [2024-10-12 01:01:37,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034384417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:01:37,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:01:37,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 01:01:37,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408066052] [2024-10-12 01:01:37,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:01:37,317 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:01:37,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:01:37,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 01:01:37,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 01:01:37,355 INFO L87 Difference]: Start difference. First operand has 41 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 32 states have internal predecessors, (36), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 01:01:37,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:01:37,579 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2024-10-12 01:01:37,581 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 61 transitions. [2024-10-12 01:01:37,585 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-10-12 01:01:37,591 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 33 states and 41 transitions. [2024-10-12 01:01:37,592 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2024-10-12 01:01:37,592 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2024-10-12 01:01:37,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2024-10-12 01:01:37,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:01:37,594 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 41 transitions. [2024-10-12 01:01:37,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2024-10-12 01:01:37,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2024-10-12 01:01:37,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 20 states have internal predecessors, (20), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-12 01:01:37,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-10-12 01:01:37,621 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-10-12 01:01:37,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 01:01:37,626 INFO L425 stractBuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-10-12 01:01:37,626 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 01:01:37,626 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2024-10-12 01:01:37,628 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-10-12 01:01:37,628 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:01:37,628 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:01:37,629 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-12 01:01:37,629 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-12 01:01:37,629 INFO L745 eck$LassoCheckResult]: Stem: 136#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 124#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(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#1(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#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 120#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 121#$Ultimate##0 [2024-10-12 01:01:37,630 INFO L747 eck$LassoCheckResult]: Loop: 121#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#2(~a.base, ~a.offset, 4); 123#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~b.base, ~b.offset, 4); 110#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 111#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 131#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 113#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 125#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 112#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 116#L41-1 assume true; 132#func_to_recursive_line_24_to_25_0EXIT >#84#return; 134#L67-1 call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 109#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 111#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 131#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 117#L61-1 assume true; 118#func_to_recursive_line_23_to_24_0EXIT >#86#return; 122#L61-1 assume true; 137#func_to_recursive_line_23_to_24_0EXIT >#88#return; 128#L87-1 call #t~mem14 := read~int#2(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 119#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 121#$Ultimate##0 [2024-10-12 01:01:37,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:37,630 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 2 times [2024-10-12 01:01:37,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:37,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22218846] [2024-10-12 01:01:37,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:37,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:37,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:37,659 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:01:37,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:37,675 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:01:37,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:37,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1860565822, now seen corresponding path program 1 times [2024-10-12 01:01:37,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:37,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613166728] [2024-10-12 01:01:37,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:37,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:37,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:37,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:38,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:38,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:38,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 01:01:38,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:38,123 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-12 01:01:38,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:01:38,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613166728] [2024-10-12 01:01:38,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613166728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:01:38,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:01:38,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 01:01:38,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989149441] [2024-10-12 01:01:38,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:01:38,124 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:01:38,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:01:38,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 01:01:38,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 01:01:38,128 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. cyclomatic complexity: 10 Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 01:01:38,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:01:38,286 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2024-10-12 01:01:38,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 40 transitions. [2024-10-12 01:01:38,288 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-10-12 01:01:38,289 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 40 transitions. [2024-10-12 01:01:38,289 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2024-10-12 01:01:38,292 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2024-10-12 01:01:38,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 40 transitions. [2024-10-12 01:01:38,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:01:38,293 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 40 transitions. [2024-10-12 01:01:38,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 40 transitions. [2024-10-12 01:01:38,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2024-10-12 01:01:38,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 21 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-10-12 01:01:38,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-10-12 01:01:38,300 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-10-12 01:01:38,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 01:01:38,301 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-10-12 01:01:38,301 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 01:01:38,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2024-10-12 01:01:38,302 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-10-12 01:01:38,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:01:38,303 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:01:38,303 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-12 01:01:38,303 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-12 01:01:38,304 INFO L745 eck$LassoCheckResult]: Stem: 237#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 223#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(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#1(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#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 219#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 220#$Ultimate##0 [2024-10-12 01:01:38,304 INFO L747 eck$LassoCheckResult]: Loop: 220#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#2(~a.base, ~a.offset, 4); 222#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~b.base, ~b.offset, 4); 209#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 210#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 230#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 212#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 224#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 211#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 214#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 226#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 235#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 228#L25-1 assume true; 229#func_to_recursive_line_25_to_25_0EXIT >#80#return; 233#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 213#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 224#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 211#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 215#L41-1 assume true; 236#func_to_recursive_line_24_to_25_0EXIT >#82#return; 231#L41-1 assume true; 232#func_to_recursive_line_24_to_25_0EXIT >#84#return; 234#L67-1 call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 208#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 210#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 230#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 216#L61-1 assume true; 217#func_to_recursive_line_23_to_24_0EXIT >#86#return; 221#L61-1 assume true; 238#func_to_recursive_line_23_to_24_0EXIT >#88#return; 227#L87-1 call #t~mem14 := read~int#2(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 218#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 220#$Ultimate##0 [2024-10-12 01:01:38,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:38,307 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 3 times [2024-10-12 01:01:38,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:38,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081646289] [2024-10-12 01:01:38,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:38,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:38,325 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:01:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:38,339 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:01:38,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:38,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1780666575, now seen corresponding path program 1 times [2024-10-12 01:01:38,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:38,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27384056] [2024-10-12 01:01:38,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:38,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:38,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:38,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:38,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:38,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:38,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 01:01:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:38,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 01:01:38,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:38,715 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-12 01:01:38,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:01:38,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27384056] [2024-10-12 01:01:38,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27384056] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:01:38,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:01:38,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 01:01:38,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382355781] [2024-10-12 01:01:38,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:01:38,719 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:01:38,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:01:38,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 01:01:38,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 01:01:38,720 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 10 Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-12 01:01:38,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:01:38,856 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2024-10-12 01:01:38,856 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 39 transitions. [2024-10-12 01:01:38,857 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-10-12 01:01:38,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 39 transitions. [2024-10-12 01:01:38,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2024-10-12 01:01:38,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2024-10-12 01:01:38,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 39 transitions. [2024-10-12 01:01:38,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:01:38,862 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-10-12 01:01:38,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 39 transitions. [2024-10-12 01:01:38,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-12 01:01:38,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 22 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-10-12 01:01:38,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2024-10-12 01:01:38,867 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-10-12 01:01:38,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 01:01:38,868 INFO L425 stractBuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-10-12 01:01:38,869 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 01:01:38,869 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 39 transitions. [2024-10-12 01:01:38,870 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-10-12 01:01:38,870 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:01:38,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:01:38,872 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-12 01:01:38,873 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:01:38,873 INFO L745 eck$LassoCheckResult]: Stem: 369#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 355#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(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#1(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#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 351#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 352#$Ultimate##0 [2024-10-12 01:01:38,873 INFO L747 eck$LassoCheckResult]: Loop: 352#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#2(~a.base, ~a.offset, 4); 354#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~b.base, ~b.offset, 4); 341#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 342#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 362#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 344#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 356#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 343#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 346#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 358#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 367#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 357#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 358#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 367#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 360#L25-1 assume true; 361#func_to_recursive_line_25_to_25_0EXIT >#92#return; 364#L25-1 assume true; 370#func_to_recursive_line_25_to_25_0EXIT >#80#return; 365#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 345#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 356#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 343#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 347#L41-1 assume true; 363#func_to_recursive_line_24_to_25_0EXIT >#82#return; 368#L41-1 assume true; 372#func_to_recursive_line_24_to_25_0EXIT >#84#return; 366#L67-1 call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 340#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 342#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 362#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 348#L61-1 assume true; 349#func_to_recursive_line_23_to_24_0EXIT >#86#return; 353#L61-1 assume true; 371#func_to_recursive_line_23_to_24_0EXIT >#88#return; 359#L87-1 call #t~mem14 := read~int#2(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 350#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 352#$Ultimate##0 [2024-10-12 01:01:38,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:38,874 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 4 times [2024-10-12 01:01:38,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:38,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442707297] [2024-10-12 01:01:38,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:38,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:38,888 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:01:38,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:38,904 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:01:38,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:38,905 INFO L85 PathProgramCache]: Analyzing trace with hash -971158242, now seen corresponding path program 1 times [2024-10-12 01:01:38,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:38,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119437997] [2024-10-12 01:01:38,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:38,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:39,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:39,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:39,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:39,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:39,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:39,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:39,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 01:01:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:39,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 01:01:39,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:39,792 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-12 01:01:39,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:01:39,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119437997] [2024-10-12 01:01:39,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119437997] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 01:01:39,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572396537] [2024-10-12 01:01:39,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:39,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 01:01:39,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:01:39,798 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 01:01:39,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 01:01:39,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:39,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-12 01:01:39,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:01:39,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-12 01:01:40,168 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-12 01:01:40,169 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 01:01:40,865 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 01:01:40,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572396537] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 01:01:40,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 01:01:40,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 23 [2024-10-12 01:01:40,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425620601] [2024-10-12 01:01:40,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 01:01:40,867 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:01:40,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:01:40,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-12 01:01:40,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2024-10-12 01:01:40,869 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. cyclomatic complexity: 10 Second operand has 23 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 states have internal predecessors, (39), 7 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (12), 4 states have call predecessors, (12), 7 states have call successors, (12) [2024-10-12 01:01:41,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:01:41,205 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2024-10-12 01:01:41,206 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 43 transitions. [2024-10-12 01:01:41,207 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-10-12 01:01:41,208 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 43 transitions. [2024-10-12 01:01:41,208 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2024-10-12 01:01:41,208 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2024-10-12 01:01:41,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 43 transitions. [2024-10-12 01:01:41,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:01:41,209 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-10-12 01:01:41,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 43 transitions. [2024-10-12 01:01:41,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-12 01:01:41,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 24 states have internal predecessors, (24), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2024-10-12 01:01:41,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2024-10-12 01:01:41,213 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-10-12 01:01:41,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 01:01:41,215 INFO L425 stractBuchiCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-10-12 01:01:41,215 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-12 01:01:41,215 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 43 transitions. [2024-10-12 01:01:41,216 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-10-12 01:01:41,216 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:01:41,216 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:01:41,217 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-12 01:01:41,218 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:01:41,218 INFO L745 eck$LassoCheckResult]: Stem: 756#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 743#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(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#1(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#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 739#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 740#$Ultimate##0 [2024-10-12 01:01:41,218 INFO L747 eck$LassoCheckResult]: Loop: 740#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#2(~a.base, ~a.offset, 4); 742#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~b.base, ~b.offset, 4); 729#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 730#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 750#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 732#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 744#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 731#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 734#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 747#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 757#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 746#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 747#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 757#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 746#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 747#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 757#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 746#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 747#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 757#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 748#L25-1 assume true; 749#func_to_recursive_line_25_to_25_0EXIT >#92#return; 752#L25-1 assume true; 763#func_to_recursive_line_25_to_25_0EXIT >#92#return; 762#L25-1 assume true; 761#func_to_recursive_line_25_to_25_0EXIT >#92#return; 760#L25-1 assume true; 759#func_to_recursive_line_25_to_25_0EXIT >#80#return; 753#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 733#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 744#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 731#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 735#L41-1 assume true; 751#func_to_recursive_line_24_to_25_0EXIT >#82#return; 755#L41-1 assume true; 764#func_to_recursive_line_24_to_25_0EXIT >#84#return; 754#L67-1 call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 728#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 730#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 750#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 736#L61-1 assume true; 737#func_to_recursive_line_23_to_24_0EXIT >#86#return; 741#L61-1 assume true; 758#func_to_recursive_line_23_to_24_0EXIT >#88#return; 745#L87-1 call #t~mem14 := read~int#2(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 738#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 740#$Ultimate##0 [2024-10-12 01:01:41,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:41,219 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 5 times [2024-10-12 01:01:41,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:41,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796469306] [2024-10-12 01:01:41,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:41,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:41,232 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:01:41,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:41,242 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:01:41,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:41,243 INFO L85 PathProgramCache]: Analyzing trace with hash -2092880572, now seen corresponding path program 2 times [2024-10-12 01:01:41,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:41,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239559029] [2024-10-12 01:01:41,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:41,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:41,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:41,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:42,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:42,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:42,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:42,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:42,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:42,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:42,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:42,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:42,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:42,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 01:01:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:42,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 01:01:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:42,821 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 01:01:42,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:01:42,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239559029] [2024-10-12 01:01:42,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239559029] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 01:01:42,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844060362] [2024-10-12 01:01:42,821 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 01:01:42,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 01:01:42,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:01:42,823 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 01:01:42,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 01:01:42,935 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 01:01:42,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 01:01:42,937 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-12 01:01:42,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:01:42,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-12 01:01:43,153 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-12 01:01:43,154 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 01:01:43,638 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-12 01:01:43,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844060362] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 01:01:43,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 01:01:43,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 10] total 30 [2024-10-12 01:01:43,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235070388] [2024-10-12 01:01:43,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 01:01:43,639 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:01:43,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:01:43,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-12 01:01:43,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=757, Unknown=0, NotChecked=0, Total=870 [2024-10-12 01:01:43,640 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. cyclomatic complexity: 10 Second operand has 30 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 24 states have internal predecessors, (48), 11 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (17), 9 states have call predecessors, (17), 11 states have call successors, (17) [2024-10-12 01:01:44,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:01:44,208 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2024-10-12 01:01:44,208 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 47 transitions. [2024-10-12 01:01:44,209 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-10-12 01:01:44,210 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 47 transitions. [2024-10-12 01:01:44,210 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2024-10-12 01:01:44,210 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2024-10-12 01:01:44,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 47 transitions. [2024-10-12 01:01:44,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:01:44,211 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-10-12 01:01:44,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 47 transitions. [2024-10-12 01:01:44,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-12 01:01:44,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 26 states have internal predecessors, (26), 8 states have call successors, (8), 4 states have call predecessors, (8), 10 states have return successors, (13), 10 states have call predecessors, (13), 6 states have call successors, (13) [2024-10-12 01:01:44,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2024-10-12 01:01:44,215 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-10-12 01:01:44,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-12 01:01:44,216 INFO L425 stractBuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-10-12 01:01:44,216 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-12 01:01:44,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 47 transitions. [2024-10-12 01:01:44,220 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-10-12 01:01:44,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:01:44,220 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:01:44,222 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-12 01:01:44,222 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 10, 8, 8, 8, 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-12 01:01:44,222 INFO L745 eck$LassoCheckResult]: Stem: 1289#$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); 1274#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(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#1(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#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 1270#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 1271#$Ultimate##0 [2024-10-12 01:01:44,222 INFO L747 eck$LassoCheckResult]: Loop: 1271#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#2(~a.base, ~a.offset, 4); 1273#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~b.base, ~b.offset, 4); 1260#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1261#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 1281#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 1264#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 1275#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 1262#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 1265#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1277#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 1288#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1276#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1277#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 1288#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1276#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1277#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 1288#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1276#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1277#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 1288#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1276#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1277#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 1288#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1279#L25-1 assume true; 1280#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1284#L25-1 assume true; 1299#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1298#L25-1 assume true; 1297#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1296#L25-1 assume true; 1294#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1291#L25-1 assume true; 1290#func_to_recursive_line_25_to_25_0EXIT >#80#return; 1285#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 1263#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 1275#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 1262#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1266#L41-1 assume true; 1287#func_to_recursive_line_24_to_25_0EXIT >#82#return; 1282#L41-1 assume true; 1283#func_to_recursive_line_24_to_25_0EXIT >#84#return; 1286#L67-1 call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 1259#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1261#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 1281#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 1264#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 1275#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 1262#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 1265#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1277#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 1288#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1276#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1277#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 1288#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1276#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1277#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 1288#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1276#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1277#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 1288#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1276#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1277#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 1288#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1279#L25-1 assume true; 1280#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1284#L25-1 assume true; 1299#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1298#L25-1 assume true; 1297#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1296#L25-1 assume true; 1294#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1291#L25-1 assume true; 1290#func_to_recursive_line_25_to_25_0EXIT >#80#return; 1285#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 1263#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 1275#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 1262#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1266#L41-1 assume true; 1287#func_to_recursive_line_24_to_25_0EXIT >#82#return; 1282#L41-1 assume true; 1283#func_to_recursive_line_24_to_25_0EXIT >#84#return; 1286#L67-1 call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 1259#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1261#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 1281#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1267#L61-1 assume true; 1268#func_to_recursive_line_23_to_24_0EXIT >#86#return; 1272#L61-1 assume true; 1295#func_to_recursive_line_23_to_24_0EXIT >#86#return; 1293#L61-1 assume true; 1292#func_to_recursive_line_23_to_24_0EXIT >#88#return; 1278#L87-1 call #t~mem14 := read~int#2(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 1269#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 1271#$Ultimate##0 [2024-10-12 01:01:44,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:44,223 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 6 times [2024-10-12 01:01:44,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:44,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660858810] [2024-10-12 01:01:44,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:44,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:44,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:44,237 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:01:44,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:44,243 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:01:44,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:44,243 INFO L85 PathProgramCache]: Analyzing trace with hash -501865090, now seen corresponding path program 3 times [2024-10-12 01:01:44,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:44,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605366134] [2024-10-12 01:01:44,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:44,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:44,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:44,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:44,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:45,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:45,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:45,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:45,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:45,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:45,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:45,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:45,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:45,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:45,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:01:45,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:45,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 01:01:45,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:45,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:45,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:45,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:45,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:45,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:45,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:45,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:45,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:45,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:01:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:45,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 01:01:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:45,273 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-10-12 01:01:45,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:01:45,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605366134] [2024-10-12 01:01:45,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605366134] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 01:01:45,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990976213] [2024-10-12 01:01:45,274 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 01:01:45,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 01:01:45,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:01:45,277 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 01:01:45,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 01:01:45,414 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-12 01:01:45,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 01:01:45,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-12 01:01:45,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:01:45,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-12 01:01:45,709 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-10-12 01:01:45,710 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 01:01:46,604 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-10-12 01:01:46,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990976213] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 01:01:46,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 01:01:46,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 14] total 31 [2024-10-12 01:01:46,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639899904] [2024-10-12 01:01:46,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 01:01:46,606 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:01:46,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:01:46,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-12 01:01:46,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=792, Unknown=0, NotChecked=0, Total=930 [2024-10-12 01:01:46,607 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. cyclomatic complexity: 10 Second operand has 31 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 states have internal predecessors, (50), 13 states have call successors, (22), 9 states have call predecessors, (22), 10 states have return successors, (19), 11 states have call predecessors, (19), 13 states have call successors, (19) [2024-10-12 01:01:47,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:01:47,039 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2024-10-12 01:01:47,039 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 51 transitions. [2024-10-12 01:01:47,040 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-10-12 01:01:47,041 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 51 transitions. [2024-10-12 01:01:47,041 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2024-10-12 01:01:47,041 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2024-10-12 01:01:47,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 51 transitions. [2024-10-12 01:01:47,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:01:47,042 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 51 transitions. [2024-10-12 01:01:47,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 51 transitions. [2024-10-12 01:01:47,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-12 01:01:47,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 25 states have (on average 1.12) internal successors, (28), 28 states have internal predecessors, (28), 8 states have call successors, (8), 4 states have call predecessors, (8), 12 states have return successors, (15), 12 states have call predecessors, (15), 6 states have call successors, (15) [2024-10-12 01:01:47,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2024-10-12 01:01:47,046 INFO L240 hiAutomatonCegarLoop]: Abstraction has 45 states and 51 transitions. [2024-10-12 01:01:47,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-12 01:01:47,048 INFO L425 stractBuchiCegarLoop]: Abstraction has 45 states and 51 transitions. [2024-10-12 01:01:47,048 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-12 01:01:47,048 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 51 transitions. [2024-10-12 01:01:47,049 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-10-12 01:01:47,049 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:01:47,049 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:01:47,053 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-12 01:01:47,054 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [30, 30, 24, 24, 24, 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-12 01:01:47,054 INFO L745 eck$LassoCheckResult]: Stem: 2336#$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); 2322#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(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#1(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#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 2318#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 2319#$Ultimate##0 [2024-10-12 01:01:47,054 INFO L747 eck$LassoCheckResult]: Loop: 2319#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#2(~a.base, ~a.offset, 4); 2321#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~b.base, ~b.offset, 4); 2308#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2309#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 2329#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 2312#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 2323#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 2310#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 2313#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 2326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 2338#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 2325#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 2326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 2338#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 2325#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 2326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 2338#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 2325#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 2326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 2338#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 2325#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 2326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 2338#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2327#L25-1 assume true; 2328#func_to_recursive_line_25_to_25_0EXIT >#92#return; 2333#L25-1 assume true; 2349#func_to_recursive_line_25_to_25_0EXIT >#92#return; 2348#L25-1 assume true; 2347#func_to_recursive_line_25_to_25_0EXIT >#92#return; 2346#L25-1 assume true; 2344#func_to_recursive_line_25_to_25_0EXIT >#92#return; 2342#L25-1 assume true; 2341#func_to_recursive_line_25_to_25_0EXIT >#80#return; 2334#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 2311#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 2323#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 2310#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 2313#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 2326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 2338#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 2325#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 2326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 2338#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 2325#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 2326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 2338#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 2325#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 2326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 2338#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 2325#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 2326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 2338#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2327#L25-1 assume true; 2328#func_to_recursive_line_25_to_25_0EXIT >#92#return; 2333#L25-1 assume true; 2349#func_to_recursive_line_25_to_25_0EXIT >#92#return; 2348#L25-1 assume true; 2347#func_to_recursive_line_25_to_25_0EXIT >#92#return; 2346#L25-1 assume true; 2344#func_to_recursive_line_25_to_25_0EXIT >#92#return; 2342#L25-1 assume true; 2341#func_to_recursive_line_25_to_25_0EXIT >#80#return; 2334#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 2311#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 2323#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 2310#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2314#L41-1 assume true; 2337#func_to_recursive_line_24_to_25_0EXIT >#82#return; 2330#L41-1 assume true; 2331#func_to_recursive_line_24_to_25_0EXIT >#82#return; 2351#L41-1 assume true; 2350#func_to_recursive_line_24_to_25_0EXIT >#84#return; 2335#L67-1 call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 2307#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2309#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 2329#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 2312#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 2323#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 2310#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 2313#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 2326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 2338#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 2325#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 2326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 2338#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 2325#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 2326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 2338#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 2325#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 2326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 2338#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 2325#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 2326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 2338#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2327#L25-1 assume true; 2328#func_to_recursive_line_25_to_25_0EXIT >#92#return; 2333#L25-1 assume true; 2349#func_to_recursive_line_25_to_25_0EXIT >#92#return; 2348#L25-1 assume true; 2347#func_to_recursive_line_25_to_25_0EXIT >#92#return; 2346#L25-1 assume true; 2344#func_to_recursive_line_25_to_25_0EXIT >#92#return; 2342#L25-1 assume true; 2341#func_to_recursive_line_25_to_25_0EXIT >#80#return; 2334#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 2311#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 2323#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 2310#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 2313#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 2326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 2338#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 2325#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 2326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 2338#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 2325#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 2326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 2338#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 2325#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 2326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 2338#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 2325#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 2326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 2338#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2327#L25-1 assume true; 2328#func_to_recursive_line_25_to_25_0EXIT >#92#return; 2333#L25-1 assume true; 2349#func_to_recursive_line_25_to_25_0EXIT >#92#return; 2348#L25-1 assume true; 2347#func_to_recursive_line_25_to_25_0EXIT >#92#return; 2346#L25-1 assume true; 2344#func_to_recursive_line_25_to_25_0EXIT >#92#return; 2342#L25-1 assume true; 2341#func_to_recursive_line_25_to_25_0EXIT >#80#return; 2334#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 2311#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 2323#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 2310#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2314#L41-1 assume true; 2337#func_to_recursive_line_24_to_25_0EXIT >#82#return; 2330#L41-1 assume true; 2331#func_to_recursive_line_24_to_25_0EXIT >#82#return; 2351#L41-1 assume true; 2350#func_to_recursive_line_24_to_25_0EXIT >#84#return; 2335#L67-1 call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 2307#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2309#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 2329#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 2312#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 2323#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 2310#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 2313#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 2326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 2338#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 2325#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 2326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 2338#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 2325#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 2326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 2338#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 2325#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 2326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 2338#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 2325#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 2326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 2338#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2327#L25-1 assume true; 2328#func_to_recursive_line_25_to_25_0EXIT >#92#return; 2333#L25-1 assume true; 2349#func_to_recursive_line_25_to_25_0EXIT >#92#return; 2348#L25-1 assume true; 2347#func_to_recursive_line_25_to_25_0EXIT >#92#return; 2346#L25-1 assume true; 2344#func_to_recursive_line_25_to_25_0EXIT >#92#return; 2342#L25-1 assume true; 2341#func_to_recursive_line_25_to_25_0EXIT >#80#return; 2334#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 2311#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 2323#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 2310#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 2313#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 2326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 2338#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 2325#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 2326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 2338#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 2325#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 2326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 2338#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 2325#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 2326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 2338#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 2325#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 2326#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 2338#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2327#L25-1 assume true; 2328#func_to_recursive_line_25_to_25_0EXIT >#92#return; 2333#L25-1 assume true; 2349#func_to_recursive_line_25_to_25_0EXIT >#92#return; 2348#L25-1 assume true; 2347#func_to_recursive_line_25_to_25_0EXIT >#92#return; 2346#L25-1 assume true; 2344#func_to_recursive_line_25_to_25_0EXIT >#92#return; 2342#L25-1 assume true; 2341#func_to_recursive_line_25_to_25_0EXIT >#80#return; 2334#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 2311#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 2323#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 2310#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2314#L41-1 assume true; 2337#func_to_recursive_line_24_to_25_0EXIT >#82#return; 2330#L41-1 assume true; 2331#func_to_recursive_line_24_to_25_0EXIT >#82#return; 2351#L41-1 assume true; 2350#func_to_recursive_line_24_to_25_0EXIT >#84#return; 2335#L67-1 call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 2307#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2309#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 2329#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 2332#L61-1 assume true; 2320#func_to_recursive_line_23_to_24_0EXIT >#86#return; 2315#L61-1 assume true; 2316#func_to_recursive_line_23_to_24_0EXIT >#86#return; 2345#L61-1 assume true; 2343#func_to_recursive_line_23_to_24_0EXIT >#86#return; 2340#L61-1 assume true; 2339#func_to_recursive_line_23_to_24_0EXIT >#88#return; 2324#L87-1 call #t~mem14 := read~int#2(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 2317#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 2319#$Ultimate##0 [2024-10-12 01:01:47,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:47,055 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 7 times [2024-10-12 01:01:47,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:47,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927774730] [2024-10-12 01:01:47,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:47,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:47,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:47,073 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:01:47,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:47,082 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:01:47,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:47,083 INFO L85 PathProgramCache]: Analyzing trace with hash 990602320, now seen corresponding path program 4 times [2024-10-12 01:01:47,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:47,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622529856] [2024-10-12 01:01:47,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:47,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:47,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:49,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:49,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:50,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:50,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:50,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:50,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:50,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:50,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:50,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:50,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:50,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:50,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:01:50,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:50,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:50,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:50,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:50,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:01:51,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 01:01:51,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:01:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:01:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 01:01:51,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:01:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 01:01:51,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 01:01:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:51,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2238 backedges. 109 proven. 453 refuted. 0 times theorem prover too weak. 1676 trivial. 0 not checked. [2024-10-12 01:01:51,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:01:51,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622529856] [2024-10-12 01:01:51,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622529856] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 01:01:51,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494789913] [2024-10-12 01:01:51,496 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-12 01:01:51,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 01:01:51,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:01:51,498 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 01:01:51,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 01:01:51,819 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-12 01:01:51,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 01:01:51,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 1388 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-10-12 01:01:51,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:01:51,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-12 01:01:52,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2238 backedges. 683 proven. 27 refuted. 0 times theorem prover too weak. 1528 trivial. 0 not checked. [2024-10-12 01:01:52,277 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 01:01:55,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2238 backedges. 633 proven. 46 refuted. 0 times theorem prover too weak. 1559 trivial. 0 not checked. [2024-10-12 01:01:55,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494789913] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 01:01:55,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 01:01:55,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 22] total 47 [2024-10-12 01:01:55,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692480902] [2024-10-12 01:01:55,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 01:01:55,492 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:01:55,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:01:55,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-10-12 01:01:55,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=1839, Unknown=0, NotChecked=0, Total=2162 [2024-10-12 01:01:55,494 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. cyclomatic complexity: 10 Second operand has 47 states, 35 states have (on average 2.085714285714286) internal successors, (73), 39 states have internal predecessors, (73), 17 states have call successors, (36), 10 states have call predecessors, (36), 14 states have return successors, (37), 15 states have call predecessors, (37), 17 states have call successors, (37) [2024-10-12 01:01:56,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:01:56,067 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2024-10-12 01:01:56,067 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 55 transitions. [2024-10-12 01:01:56,068 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-10-12 01:01:56,069 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 55 transitions. [2024-10-12 01:01:56,069 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2024-10-12 01:01:56,069 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2024-10-12 01:01:56,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 55 transitions. [2024-10-12 01:01:56,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:01:56,070 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 55 transitions. [2024-10-12 01:01:56,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 55 transitions. [2024-10-12 01:01:56,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-12 01:01:56,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 30 states have internal predecessors, (30), 8 states have call successors, (8), 4 states have call predecessors, (8), 14 states have return successors, (17), 14 states have call predecessors, (17), 6 states have call successors, (17) [2024-10-12 01:01:56,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2024-10-12 01:01:56,074 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 55 transitions. [2024-10-12 01:01:56,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-12 01:01:56,075 INFO L425 stractBuchiCegarLoop]: Abstraction has 49 states and 55 transitions. [2024-10-12 01:01:56,075 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-12 01:01:56,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 55 transitions. [2024-10-12 01:01:56,076 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-10-12 01:01:56,076 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:01:56,076 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:01:56,079 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-12 01:01:56,079 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [42, 42, 36, 36, 36, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:01:56,080 INFO L745 eck$LassoCheckResult]: Stem: 5058#$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); 5043#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(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#1(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#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 5039#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 5040#$Ultimate##0 [2024-10-12 01:01:56,080 INFO L747 eck$LassoCheckResult]: Loop: 5040#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#2(~a.base, ~a.offset, 4); 5042#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~b.base, ~b.offset, 4); 5029#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 5030#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 5050#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 5033#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 5044#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 5031#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 5034#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5047#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 5059#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5046#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5047#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 5059#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5046#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5047#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 5059#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5046#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5047#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 5059#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5046#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5047#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 5059#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5046#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5047#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 5059#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5046#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5047#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 5059#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 5060#L25-1 assume true; 5054#func_to_recursive_line_25_to_25_0EXIT >#92#return; 5048#L25-1 assume true; 5049#func_to_recursive_line_25_to_25_0EXIT >#92#return; 5076#L25-1 assume true; 5073#func_to_recursive_line_25_to_25_0EXIT >#92#return; 5072#L25-1 assume true; 5071#func_to_recursive_line_25_to_25_0EXIT >#92#return; 5070#L25-1 assume true; 5069#func_to_recursive_line_25_to_25_0EXIT >#92#return; 5068#L25-1 assume true; 5066#func_to_recursive_line_25_to_25_0EXIT >#92#return; 5064#L25-1 assume true; 5063#func_to_recursive_line_25_to_25_0EXIT >#80#return; 5055#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 5032#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 5044#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 5031#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 5034#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5047#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 5059#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5046#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5047#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 5059#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5046#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5047#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 5059#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5046#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5047#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 5059#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5046#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5047#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 5059#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5046#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5047#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 5059#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5046#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5047#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 5059#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 5060#L25-1 assume true; 5054#func_to_recursive_line_25_to_25_0EXIT >#92#return; 5048#L25-1 assume true; 5049#func_to_recursive_line_25_to_25_0EXIT >#92#return; 5076#L25-1 assume true; 5073#func_to_recursive_line_25_to_25_0EXIT >#92#return; 5072#L25-1 assume true; 5071#func_to_recursive_line_25_to_25_0EXIT >#92#return; 5070#L25-1 assume true; 5069#func_to_recursive_line_25_to_25_0EXIT >#92#return; 5068#L25-1 assume true; 5066#func_to_recursive_line_25_to_25_0EXIT >#92#return; 5064#L25-1 assume true; 5063#func_to_recursive_line_25_to_25_0EXIT >#80#return; 5055#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 5032#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 5044#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 5031#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 5035#L41-1 assume true; 5057#func_to_recursive_line_24_to_25_0EXIT >#82#return; 5051#L41-1 assume true; 5052#func_to_recursive_line_24_to_25_0EXIT >#82#return; 5075#L41-1 assume true; 5074#func_to_recursive_line_24_to_25_0EXIT >#84#return; 5056#L67-1 call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 5028#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 5030#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 5050#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 5033#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 5044#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 5031#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 5034#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5047#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 5059#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5046#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5047#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 5059#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5046#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5047#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 5059#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5046#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5047#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 5059#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5046#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5047#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 5059#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5046#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5047#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 5059#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5046#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5047#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 5059#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 5060#L25-1 assume true; 5054#func_to_recursive_line_25_to_25_0EXIT >#92#return; 5048#L25-1 assume true; 5049#func_to_recursive_line_25_to_25_0EXIT >#92#return; 5076#L25-1 assume true; 5073#func_to_recursive_line_25_to_25_0EXIT >#92#return; 5072#L25-1 assume true; 5071#func_to_recursive_line_25_to_25_0EXIT >#92#return; 5070#L25-1 assume true; 5069#func_to_recursive_line_25_to_25_0EXIT >#92#return; 5068#L25-1 assume true; 5066#func_to_recursive_line_25_to_25_0EXIT >#92#return; 5064#L25-1 assume true; 5063#func_to_recursive_line_25_to_25_0EXIT >#80#return; 5055#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 5032#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 5044#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 5031#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 5034#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5047#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 5059#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5046#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5047#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 5059#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5046#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5047#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 5059#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5046#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5047#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 5059#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5046#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5047#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 5059#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5046#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5047#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 5059#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5046#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5047#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 5059#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 5060#L25-1 assume true; 5054#func_to_recursive_line_25_to_25_0EXIT >#92#return; 5048#L25-1 assume true; 5049#func_to_recursive_line_25_to_25_0EXIT >#92#return; 5076#L25-1 assume true; 5073#func_to_recursive_line_25_to_25_0EXIT >#92#return; 5072#L25-1 assume true; 5071#func_to_recursive_line_25_to_25_0EXIT >#92#return; 5070#L25-1 assume true; 5069#func_to_recursive_line_25_to_25_0EXIT >#92#return; 5068#L25-1 assume true; 5066#func_to_recursive_line_25_to_25_0EXIT >#92#return; 5064#L25-1 assume true; 5063#func_to_recursive_line_25_to_25_0EXIT >#80#return; 5055#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 5032#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 5044#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 5031#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 5035#L41-1 assume true; 5057#func_to_recursive_line_24_to_25_0EXIT >#82#return; 5051#L41-1 assume true; 5052#func_to_recursive_line_24_to_25_0EXIT >#82#return; 5075#L41-1 assume true; 5074#func_to_recursive_line_24_to_25_0EXIT >#84#return; 5056#L67-1 call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 5028#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 5030#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 5050#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 5033#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 5044#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 5031#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 5034#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5047#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 5059#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5046#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5047#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 5059#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5046#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5047#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 5059#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5046#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5047#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 5059#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5046#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5047#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 5059#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5046#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5047#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 5059#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5046#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5047#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 5059#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 5060#L25-1 assume true; 5054#func_to_recursive_line_25_to_25_0EXIT >#92#return; 5048#L25-1 assume true; 5049#func_to_recursive_line_25_to_25_0EXIT >#92#return; 5076#L25-1 assume true; 5073#func_to_recursive_line_25_to_25_0EXIT >#92#return; 5072#L25-1 assume true; 5071#func_to_recursive_line_25_to_25_0EXIT >#92#return; 5070#L25-1 assume true; 5069#func_to_recursive_line_25_to_25_0EXIT >#92#return; 5068#L25-1 assume true; 5066#func_to_recursive_line_25_to_25_0EXIT >#92#return; 5064#L25-1 assume true; 5063#func_to_recursive_line_25_to_25_0EXIT >#80#return; 5055#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 5032#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 5044#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 5031#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 5034#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5047#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 5059#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5046#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5047#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 5059#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5046#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5047#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 5059#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5046#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5047#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 5059#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5046#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5047#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 5059#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5046#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5047#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 5059#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 5046#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 5047#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 5059#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 5060#L25-1 assume true; 5054#func_to_recursive_line_25_to_25_0EXIT >#92#return; 5048#L25-1 assume true; 5049#func_to_recursive_line_25_to_25_0EXIT >#92#return; 5076#L25-1 assume true; 5073#func_to_recursive_line_25_to_25_0EXIT >#92#return; 5072#L25-1 assume true; 5071#func_to_recursive_line_25_to_25_0EXIT >#92#return; 5070#L25-1 assume true; 5069#func_to_recursive_line_25_to_25_0EXIT >#92#return; 5068#L25-1 assume true; 5066#func_to_recursive_line_25_to_25_0EXIT >#92#return; 5064#L25-1 assume true; 5063#func_to_recursive_line_25_to_25_0EXIT >#80#return; 5055#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 5032#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 5044#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 5031#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 5035#L41-1 assume true; 5057#func_to_recursive_line_24_to_25_0EXIT >#82#return; 5051#L41-1 assume true; 5052#func_to_recursive_line_24_to_25_0EXIT >#82#return; 5075#L41-1 assume true; 5074#func_to_recursive_line_24_to_25_0EXIT >#84#return; 5056#L67-1 call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 5028#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 5030#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 5050#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 5053#L61-1 assume true; 5041#func_to_recursive_line_23_to_24_0EXIT >#86#return; 5036#L61-1 assume true; 5037#func_to_recursive_line_23_to_24_0EXIT >#86#return; 5067#L61-1 assume true; 5065#func_to_recursive_line_23_to_24_0EXIT >#86#return; 5062#L61-1 assume true; 5061#func_to_recursive_line_23_to_24_0EXIT >#88#return; 5045#L87-1 call #t~mem14 := read~int#2(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 5038#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 5040#$Ultimate##0 [2024-10-12 01:01:56,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:56,081 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 8 times [2024-10-12 01:01:56,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:56,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688569588] [2024-10-12 01:01:56,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:56,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:56,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:56,091 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:01:56,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:01:56,100 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:01:56,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:01:56,101 INFO L85 PathProgramCache]: Analyzing trace with hash 732034000, now seen corresponding path program 5 times [2024-10-12 01:01:56,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:01:56,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680497608] [2024-10-12 01:01:56,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:01:56,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:01:56,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:57,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:57,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:58,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:58,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:58,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:58,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:58,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:58,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:58,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:58,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:58,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:58,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:58,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:58,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:58,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:58,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:01:58,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:59,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:59,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:59,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:59,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:59,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:59,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:59,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:59,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:59,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:59,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:59,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:59,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:59,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:59,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:01:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:59,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 01:01:59,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:59,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:59,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:59,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:59,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:59,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:59,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:59,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:59,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:59,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:59,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:59,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:59,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:59,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:01:59,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:59,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:59,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:59,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:59,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:59,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:59,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:59,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:59,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:59,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:59,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:59,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:59,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:01:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:59,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 01:01:59,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:59,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:59,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:59,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:59,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:59,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:59,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:59,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:59,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:59,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:59,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:59,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:59,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:01:59,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:59,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:59,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:59,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:59,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:59,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:59,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:59,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:59,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:59,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:59,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:59,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:01:59,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:59,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:01:59,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:59,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 01:01:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:01:59,521 INFO L134 CoverageAnalysis]: Checked inductivity of 4296 backedges. 10 proven. 92 refuted. 0 times theorem prover too weak. 4194 trivial. 0 not checked. [2024-10-12 01:01:59,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:01:59,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680497608] [2024-10-12 01:01:59,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680497608] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 01:01:59,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592811277] [2024-10-12 01:01:59,522 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-12 01:01:59,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 01:01:59,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:01:59,525 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 01:01:59,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 01:02:03,329 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2024-10-12 01:02:03,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 01:02:03,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 1526 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-12 01:02:03,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:02:03,363 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-12 01:02:03,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4296 backedges. 1960 proven. 8 refuted. 0 times theorem prover too weak. 2328 trivial. 0 not checked. [2024-10-12 01:02:03,585 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 01:02:05,068 INFO L134 CoverageAnalysis]: Checked inductivity of 4296 backedges. 6 proven. 117 refuted. 0 times theorem prover too weak. 4173 trivial. 0 not checked. [2024-10-12 01:02:05,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592811277] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 01:02:05,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 01:02:05,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 14] total 31 [2024-10-12 01:02:05,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740584663] [2024-10-12 01:02:05,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 01:02:05,070 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:02:05,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:02:05,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-12 01:02:05,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2024-10-12 01:02:05,071 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. cyclomatic complexity: 10 Second operand has 31 states, 23 states have (on average 2.782608695652174) internal successors, (64), 24 states have internal predecessors, (64), 14 states have call successors, (33), 9 states have call predecessors, (33), 9 states have return successors, (25), 11 states have call predecessors, (25), 14 states have call successors, (25) [2024-10-12 01:02:05,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:02:05,474 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2024-10-12 01:02:05,474 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 59 transitions. [2024-10-12 01:02:05,475 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-10-12 01:02:05,476 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 59 transitions. [2024-10-12 01:02:05,476 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2024-10-12 01:02:05,477 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2024-10-12 01:02:05,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 59 transitions. [2024-10-12 01:02:05,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:02:05,477 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 59 transitions. [2024-10-12 01:02:05,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 59 transitions. [2024-10-12 01:02:05,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-12 01:02:05,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 29 states have (on average 1.103448275862069) internal successors, (32), 32 states have internal predecessors, (32), 8 states have call successors, (8), 4 states have call predecessors, (8), 16 states have return successors, (19), 16 states have call predecessors, (19), 6 states have call successors, (19) [2024-10-12 01:02:05,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2024-10-12 01:02:05,484 INFO L240 hiAutomatonCegarLoop]: Abstraction has 53 states and 59 transitions. [2024-10-12 01:02:05,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 01:02:05,485 INFO L425 stractBuchiCegarLoop]: Abstraction has 53 states and 59 transitions. [2024-10-12 01:02:05,485 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-12 01:02:05,486 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 59 transitions. [2024-10-12 01:02:05,486 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-10-12 01:02:05,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:02:05,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:02:05,492 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-12 01:02:05,492 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [84, 84, 72, 72, 72, 15, 15, 12, 12, 12, 12, 12, 12, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:02:05,493 INFO L745 eck$LassoCheckResult]: Stem: 8703#$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); 8690#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(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#1(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#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 8686#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 8687#$Ultimate##0 [2024-10-12 01:02:05,494 INFO L747 eck$LassoCheckResult]: Loop: 8687#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#2(~a.base, ~a.offset, 4); 8689#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~b.base, ~b.offset, 4); 8676#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 8677#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 8697#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 8679#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 8691#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 8678#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 8681#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8706#L25-1 assume true; 8700#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8695#L25-1 assume true; 8696#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8723#L25-1 assume true; 8721#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8720#L25-1 assume true; 8717#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8716#L25-1 assume true; 8715#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8713#L25-1 assume true; 8711#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8708#L25-1 assume true; 8707#func_to_recursive_line_25_to_25_0EXIT >#80#return; 8701#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 8680#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 8691#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 8678#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 8681#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8706#L25-1 assume true; 8700#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8695#L25-1 assume true; 8696#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8723#L25-1 assume true; 8721#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8720#L25-1 assume true; 8717#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8716#L25-1 assume true; 8715#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8713#L25-1 assume true; 8711#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8708#L25-1 assume true; 8707#func_to_recursive_line_25_to_25_0EXIT >#80#return; 8701#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 8680#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 8691#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 8678#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 8681#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8706#L25-1 assume true; 8700#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8695#L25-1 assume true; 8696#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8723#L25-1 assume true; 8721#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8720#L25-1 assume true; 8717#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8716#L25-1 assume true; 8715#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8713#L25-1 assume true; 8711#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8708#L25-1 assume true; 8707#func_to_recursive_line_25_to_25_0EXIT >#80#return; 8701#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 8680#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 8691#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 8678#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 8681#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8706#L25-1 assume true; 8700#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8695#L25-1 assume true; 8696#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8723#L25-1 assume true; 8721#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8720#L25-1 assume true; 8717#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8716#L25-1 assume true; 8715#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8713#L25-1 assume true; 8711#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8708#L25-1 assume true; 8707#func_to_recursive_line_25_to_25_0EXIT >#80#return; 8701#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 8680#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 8691#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 8678#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8682#L41-1 assume true; 8698#func_to_recursive_line_24_to_25_0EXIT >#82#return; 8704#L41-1 assume true; 8727#func_to_recursive_line_24_to_25_0EXIT >#82#return; 8726#L41-1 assume true; 8725#func_to_recursive_line_24_to_25_0EXIT >#82#return; 8724#L41-1 assume true; 8722#func_to_recursive_line_24_to_25_0EXIT >#82#return; 8719#L41-1 assume true; 8718#func_to_recursive_line_24_to_25_0EXIT >#84#return; 8702#L67-1 call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 8675#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 8677#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 8697#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 8679#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 8691#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 8678#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 8681#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8706#L25-1 assume true; 8700#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8695#L25-1 assume true; 8696#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8723#L25-1 assume true; 8721#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8720#L25-1 assume true; 8717#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8716#L25-1 assume true; 8715#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8713#L25-1 assume true; 8711#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8708#L25-1 assume true; 8707#func_to_recursive_line_25_to_25_0EXIT >#80#return; 8701#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 8680#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 8691#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 8678#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 8681#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8706#L25-1 assume true; 8700#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8695#L25-1 assume true; 8696#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8723#L25-1 assume true; 8721#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8720#L25-1 assume true; 8717#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8716#L25-1 assume true; 8715#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8713#L25-1 assume true; 8711#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8708#L25-1 assume true; 8707#func_to_recursive_line_25_to_25_0EXIT >#80#return; 8701#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 8680#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 8691#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 8678#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 8681#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8706#L25-1 assume true; 8700#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8695#L25-1 assume true; 8696#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8723#L25-1 assume true; 8721#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8720#L25-1 assume true; 8717#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8716#L25-1 assume true; 8715#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8713#L25-1 assume true; 8711#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8708#L25-1 assume true; 8707#func_to_recursive_line_25_to_25_0EXIT >#80#return; 8701#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 8680#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 8691#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 8678#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 8681#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8706#L25-1 assume true; 8700#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8695#L25-1 assume true; 8696#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8723#L25-1 assume true; 8721#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8720#L25-1 assume true; 8717#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8716#L25-1 assume true; 8715#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8713#L25-1 assume true; 8711#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8708#L25-1 assume true; 8707#func_to_recursive_line_25_to_25_0EXIT >#80#return; 8701#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 8680#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 8691#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 8678#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8682#L41-1 assume true; 8698#func_to_recursive_line_24_to_25_0EXIT >#82#return; 8704#L41-1 assume true; 8727#func_to_recursive_line_24_to_25_0EXIT >#82#return; 8726#L41-1 assume true; 8725#func_to_recursive_line_24_to_25_0EXIT >#82#return; 8724#L41-1 assume true; 8722#func_to_recursive_line_24_to_25_0EXIT >#82#return; 8719#L41-1 assume true; 8718#func_to_recursive_line_24_to_25_0EXIT >#84#return; 8702#L67-1 call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 8675#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 8677#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 8697#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 8679#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 8691#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 8678#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 8681#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8706#L25-1 assume true; 8700#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8695#L25-1 assume true; 8696#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8723#L25-1 assume true; 8721#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8720#L25-1 assume true; 8717#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8716#L25-1 assume true; 8715#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8713#L25-1 assume true; 8711#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8708#L25-1 assume true; 8707#func_to_recursive_line_25_to_25_0EXIT >#80#return; 8701#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 8680#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 8691#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 8678#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 8681#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8706#L25-1 assume true; 8700#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8695#L25-1 assume true; 8696#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8723#L25-1 assume true; 8721#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8720#L25-1 assume true; 8717#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8716#L25-1 assume true; 8715#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8713#L25-1 assume true; 8711#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8708#L25-1 assume true; 8707#func_to_recursive_line_25_to_25_0EXIT >#80#return; 8701#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 8680#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 8691#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 8678#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 8681#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8706#L25-1 assume true; 8700#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8695#L25-1 assume true; 8696#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8723#L25-1 assume true; 8721#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8720#L25-1 assume true; 8717#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8716#L25-1 assume true; 8715#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8713#L25-1 assume true; 8711#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8708#L25-1 assume true; 8707#func_to_recursive_line_25_to_25_0EXIT >#80#return; 8701#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 8680#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 8691#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 8678#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 8681#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 8692#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 8693#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 8705#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8706#L25-1 assume true; 8700#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8695#L25-1 assume true; 8696#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8723#L25-1 assume true; 8721#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8720#L25-1 assume true; 8717#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8716#L25-1 assume true; 8715#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8713#L25-1 assume true; 8711#func_to_recursive_line_25_to_25_0EXIT >#92#return; 8708#L25-1 assume true; 8707#func_to_recursive_line_25_to_25_0EXIT >#80#return; 8701#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 8680#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 8691#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 8678#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8682#L41-1 assume true; 8698#func_to_recursive_line_24_to_25_0EXIT >#82#return; 8704#L41-1 assume true; 8727#func_to_recursive_line_24_to_25_0EXIT >#82#return; 8726#L41-1 assume true; 8725#func_to_recursive_line_24_to_25_0EXIT >#82#return; 8724#L41-1 assume true; 8722#func_to_recursive_line_24_to_25_0EXIT >#82#return; 8719#L41-1 assume true; 8718#func_to_recursive_line_24_to_25_0EXIT >#84#return; 8702#L67-1 call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 8675#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 8677#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 8697#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 8699#L61-1 assume true; 8688#func_to_recursive_line_23_to_24_0EXIT >#86#return; 8683#L61-1 assume true; 8684#func_to_recursive_line_23_to_24_0EXIT >#86#return; 8714#L61-1 assume true; 8712#func_to_recursive_line_23_to_24_0EXIT >#86#return; 8710#L61-1 assume true; 8709#func_to_recursive_line_23_to_24_0EXIT >#88#return; 8694#L87-1 call #t~mem14 := read~int#2(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 8685#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 8687#$Ultimate##0 [2024-10-12 01:02:05,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:02:05,495 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 9 times [2024-10-12 01:02:05,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:02:05,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438576518] [2024-10-12 01:02:05,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:02:05,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:02:05,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:02:05,513 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:02:05,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:02:05,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:02:05,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:02:05,525 INFO L85 PathProgramCache]: Analyzing trace with hash 24421248, now seen corresponding path program 6 times [2024-10-12 01:02:05,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:02:05,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031455591] [2024-10-12 01:02:05,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:02:05,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:02:05,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:09,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:09,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:11,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:11,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:12,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:12,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:12,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:12,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:12,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:12,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:12,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:12,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:12,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:12,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:12,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:12,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:12,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:12,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:13,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:13,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:13,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:13,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:13,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:13,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:13,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:13,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:13,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:13,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:13,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:13,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:13,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:13,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:13,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:13,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:13,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:13,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:13,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:13,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:13,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:13,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:13,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:13,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:13,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:13,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:13,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:13,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:13,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:13,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:13,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:13,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:13,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:13,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:13,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:13,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:13,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:13,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:13,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:13,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:13,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:13,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:13,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-12 01:02:13,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:13,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:13,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:13,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:13,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:13,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:13,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:13,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:13,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:13,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:13,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:13,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:13,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:13,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:13,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:13,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:13,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:13,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:13,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:13,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:13,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:13,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:14,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:14,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:14,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:14,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:14,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:14,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:14,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:14,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:14,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:14,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:14,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:14,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:14,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:14,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:14,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:14,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:14,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:14,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-12 01:02:14,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:14,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:14,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:14,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:14,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:14,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:14,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:14,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:14,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:14,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:14,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:14,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:14,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:14,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:14,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:14,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:14,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:14,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:14,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:14,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:14,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:14,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-12 01:02:14,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:14,488 INFO L134 CoverageAnalysis]: Checked inductivity of 17151 backedges. 6 proven. 276 refuted. 0 times theorem prover too weak. 16869 trivial. 0 not checked. [2024-10-12 01:02:14,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:02:14,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031455591] [2024-10-12 01:02:14,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031455591] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 01:02:14,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501886025] [2024-10-12 01:02:14,489 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-12 01:02:14,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 01:02:14,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:14,491 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 01:02:14,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-12 01:02:14,930 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-10-12 01:02:14,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 01:02:14,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-10-12 01:02:14,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:02:14,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-12 01:02:15,266 INFO L134 CoverageAnalysis]: Checked inductivity of 17151 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 17136 trivial. 0 not checked. [2024-10-12 01:02:15,266 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 01:02:17,630 INFO L134 CoverageAnalysis]: Checked inductivity of 17151 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 17118 trivial. 0 not checked. [2024-10-12 01:02:17,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501886025] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 01:02:17,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 01:02:17,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 18] total 39 [2024-10-12 01:02:17,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776041236] [2024-10-12 01:02:17,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 01:02:17,632 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:02:17,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:02:17,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-10-12 01:02:17,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1276, Unknown=0, NotChecked=0, Total=1482 [2024-10-12 01:02:17,634 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. cyclomatic complexity: 10 Second operand has 39 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 31 states have internal predecessors, (58), 15 states have call successors, (24), 10 states have call predecessors, (24), 15 states have return successors, (25), 17 states have call predecessors, (25), 15 states have call successors, (25) [2024-10-12 01:02:18,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:02:18,145 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2024-10-12 01:02:18,145 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 63 transitions. [2024-10-12 01:02:18,146 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-10-12 01:02:18,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 57 states and 63 transitions. [2024-10-12 01:02:18,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2024-10-12 01:02:18,147 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2024-10-12 01:02:18,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 63 transitions. [2024-10-12 01:02:18,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:02:18,148 INFO L218 hiAutomatonCegarLoop]: Abstraction has 57 states and 63 transitions. [2024-10-12 01:02:18,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 63 transitions. [2024-10-12 01:02:18,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-10-12 01:02:18,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 31 states have (on average 1.096774193548387) internal successors, (34), 34 states have internal predecessors, (34), 8 states have call successors, (8), 4 states have call predecessors, (8), 18 states have return successors, (21), 18 states have call predecessors, (21), 6 states have call successors, (21) [2024-10-12 01:02:18,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2024-10-12 01:02:18,153 INFO L240 hiAutomatonCegarLoop]: Abstraction has 57 states and 63 transitions. [2024-10-12 01:02:18,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-12 01:02:18,154 INFO L425 stractBuchiCegarLoop]: Abstraction has 57 states and 63 transitions. [2024-10-12 01:02:18,154 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-12 01:02:18,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 63 transitions. [2024-10-12 01:02:18,155 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-10-12 01:02:18,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:02:18,155 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:02:18,163 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-12 01:02:18,164 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [140, 140, 120, 120, 120, 24, 24, 20, 20, 20, 20, 20, 20, 20, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:02:18,164 INFO L745 eck$LassoCheckResult]: Stem: 16031#$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); 16018#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(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#1(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#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 16014#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 16015#$Ultimate##0 [2024-10-12 01:02:18,165 INFO L747 eck$LassoCheckResult]: Loop: 16015#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#2(~a.base, ~a.offset, 4); 16017#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~b.base, ~b.offset, 4); 16004#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 16005#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 16025#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 16007#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 16019#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 16006#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 16009#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16023#L25-1 assume true; 16024#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16028#L25-1 assume true; 16051#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16050#L25-1 assume true; 16049#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16048#L25-1 assume true; 16047#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16045#L25-1 assume true; 16043#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16041#L25-1 assume true; 16039#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16037#L25-1 assume true; 16036#func_to_recursive_line_25_to_25_0EXIT >#80#return; 16029#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 16008#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 16019#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 16006#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 16009#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16023#L25-1 assume true; 16024#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16028#L25-1 assume true; 16051#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16050#L25-1 assume true; 16049#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16048#L25-1 assume true; 16047#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16045#L25-1 assume true; 16043#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16041#L25-1 assume true; 16039#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16037#L25-1 assume true; 16036#func_to_recursive_line_25_to_25_0EXIT >#80#return; 16029#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 16008#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 16019#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 16006#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 16009#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16023#L25-1 assume true; 16024#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16028#L25-1 assume true; 16051#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16050#L25-1 assume true; 16049#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16048#L25-1 assume true; 16047#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16045#L25-1 assume true; 16043#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16041#L25-1 assume true; 16039#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16037#L25-1 assume true; 16036#func_to_recursive_line_25_to_25_0EXIT >#80#return; 16029#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 16008#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 16019#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 16006#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 16009#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16023#L25-1 assume true; 16024#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16028#L25-1 assume true; 16051#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16050#L25-1 assume true; 16049#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16048#L25-1 assume true; 16047#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16045#L25-1 assume true; 16043#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16041#L25-1 assume true; 16039#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16037#L25-1 assume true; 16036#func_to_recursive_line_25_to_25_0EXIT >#80#return; 16029#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 16008#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 16019#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 16006#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 16009#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16023#L25-1 assume true; 16024#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16028#L25-1 assume true; 16051#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16050#L25-1 assume true; 16049#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16048#L25-1 assume true; 16047#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16045#L25-1 assume true; 16043#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16041#L25-1 assume true; 16039#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16037#L25-1 assume true; 16036#func_to_recursive_line_25_to_25_0EXIT >#80#return; 16029#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 16008#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 16019#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 16006#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 16010#L41-1 assume true; 16032#func_to_recursive_line_24_to_25_0EXIT >#82#return; 16026#L41-1 assume true; 16027#func_to_recursive_line_24_to_25_0EXIT >#82#return; 16059#L41-1 assume true; 16058#func_to_recursive_line_24_to_25_0EXIT >#82#return; 16057#L41-1 assume true; 16056#func_to_recursive_line_24_to_25_0EXIT >#82#return; 16055#L41-1 assume true; 16054#func_to_recursive_line_24_to_25_0EXIT >#82#return; 16053#L41-1 assume true; 16052#func_to_recursive_line_24_to_25_0EXIT >#84#return; 16030#L67-1 call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 16003#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 16005#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 16025#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 16007#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 16019#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 16006#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 16009#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16023#L25-1 assume true; 16024#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16028#L25-1 assume true; 16051#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16050#L25-1 assume true; 16049#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16048#L25-1 assume true; 16047#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16045#L25-1 assume true; 16043#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16041#L25-1 assume true; 16039#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16037#L25-1 assume true; 16036#func_to_recursive_line_25_to_25_0EXIT >#80#return; 16029#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 16008#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 16019#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 16006#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 16009#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16023#L25-1 assume true; 16024#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16028#L25-1 assume true; 16051#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16050#L25-1 assume true; 16049#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16048#L25-1 assume true; 16047#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16045#L25-1 assume true; 16043#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16041#L25-1 assume true; 16039#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16037#L25-1 assume true; 16036#func_to_recursive_line_25_to_25_0EXIT >#80#return; 16029#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 16008#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 16019#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 16006#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 16009#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16023#L25-1 assume true; 16024#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16028#L25-1 assume true; 16051#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16050#L25-1 assume true; 16049#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16048#L25-1 assume true; 16047#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16045#L25-1 assume true; 16043#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16041#L25-1 assume true; 16039#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16037#L25-1 assume true; 16036#func_to_recursive_line_25_to_25_0EXIT >#80#return; 16029#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 16008#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 16019#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 16006#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 16009#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16023#L25-1 assume true; 16024#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16028#L25-1 assume true; 16051#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16050#L25-1 assume true; 16049#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16048#L25-1 assume true; 16047#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16045#L25-1 assume true; 16043#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16041#L25-1 assume true; 16039#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16037#L25-1 assume true; 16036#func_to_recursive_line_25_to_25_0EXIT >#80#return; 16029#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 16008#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 16019#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 16006#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 16009#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16023#L25-1 assume true; 16024#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16028#L25-1 assume true; 16051#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16050#L25-1 assume true; 16049#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16048#L25-1 assume true; 16047#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16045#L25-1 assume true; 16043#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16041#L25-1 assume true; 16039#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16037#L25-1 assume true; 16036#func_to_recursive_line_25_to_25_0EXIT >#80#return; 16029#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 16008#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 16019#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 16006#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 16010#L41-1 assume true; 16032#func_to_recursive_line_24_to_25_0EXIT >#82#return; 16026#L41-1 assume true; 16027#func_to_recursive_line_24_to_25_0EXIT >#82#return; 16059#L41-1 assume true; 16058#func_to_recursive_line_24_to_25_0EXIT >#82#return; 16057#L41-1 assume true; 16056#func_to_recursive_line_24_to_25_0EXIT >#82#return; 16055#L41-1 assume true; 16054#func_to_recursive_line_24_to_25_0EXIT >#82#return; 16053#L41-1 assume true; 16052#func_to_recursive_line_24_to_25_0EXIT >#84#return; 16030#L67-1 call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 16003#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 16005#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 16025#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 16007#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 16019#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 16006#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 16009#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16023#L25-1 assume true; 16024#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16028#L25-1 assume true; 16051#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16050#L25-1 assume true; 16049#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16048#L25-1 assume true; 16047#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16045#L25-1 assume true; 16043#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16041#L25-1 assume true; 16039#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16037#L25-1 assume true; 16036#func_to_recursive_line_25_to_25_0EXIT >#80#return; 16029#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 16008#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 16019#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 16006#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 16009#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16023#L25-1 assume true; 16024#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16028#L25-1 assume true; 16051#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16050#L25-1 assume true; 16049#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16048#L25-1 assume true; 16047#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16045#L25-1 assume true; 16043#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16041#L25-1 assume true; 16039#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16037#L25-1 assume true; 16036#func_to_recursive_line_25_to_25_0EXIT >#80#return; 16029#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 16008#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 16019#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 16006#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 16009#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16023#L25-1 assume true; 16024#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16028#L25-1 assume true; 16051#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16050#L25-1 assume true; 16049#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16048#L25-1 assume true; 16047#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16045#L25-1 assume true; 16043#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16041#L25-1 assume true; 16039#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16037#L25-1 assume true; 16036#func_to_recursive_line_25_to_25_0EXIT >#80#return; 16029#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 16008#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 16019#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 16006#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 16009#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16023#L25-1 assume true; 16024#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16028#L25-1 assume true; 16051#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16050#L25-1 assume true; 16049#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16048#L25-1 assume true; 16047#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16045#L25-1 assume true; 16043#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16041#L25-1 assume true; 16039#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16037#L25-1 assume true; 16036#func_to_recursive_line_25_to_25_0EXIT >#80#return; 16029#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 16008#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 16019#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 16006#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 16009#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16023#L25-1 assume true; 16024#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16028#L25-1 assume true; 16051#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16050#L25-1 assume true; 16049#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16048#L25-1 assume true; 16047#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16045#L25-1 assume true; 16043#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16041#L25-1 assume true; 16039#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16037#L25-1 assume true; 16036#func_to_recursive_line_25_to_25_0EXIT >#80#return; 16029#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 16008#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 16019#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 16006#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 16010#L41-1 assume true; 16032#func_to_recursive_line_24_to_25_0EXIT >#82#return; 16026#L41-1 assume true; 16027#func_to_recursive_line_24_to_25_0EXIT >#82#return; 16059#L41-1 assume true; 16058#func_to_recursive_line_24_to_25_0EXIT >#82#return; 16057#L41-1 assume true; 16056#func_to_recursive_line_24_to_25_0EXIT >#82#return; 16055#L41-1 assume true; 16054#func_to_recursive_line_24_to_25_0EXIT >#82#return; 16053#L41-1 assume true; 16052#func_to_recursive_line_24_to_25_0EXIT >#84#return; 16030#L67-1 call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 16003#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 16005#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 16025#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 16007#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 16019#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 16006#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 16009#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16023#L25-1 assume true; 16024#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16028#L25-1 assume true; 16051#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16050#L25-1 assume true; 16049#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16048#L25-1 assume true; 16047#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16045#L25-1 assume true; 16043#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16041#L25-1 assume true; 16039#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16037#L25-1 assume true; 16036#func_to_recursive_line_25_to_25_0EXIT >#80#return; 16029#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 16008#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 16019#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 16006#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 16009#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16023#L25-1 assume true; 16024#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16028#L25-1 assume true; 16051#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16050#L25-1 assume true; 16049#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16048#L25-1 assume true; 16047#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16045#L25-1 assume true; 16043#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16041#L25-1 assume true; 16039#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16037#L25-1 assume true; 16036#func_to_recursive_line_25_to_25_0EXIT >#80#return; 16029#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 16008#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 16019#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 16006#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 16009#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16023#L25-1 assume true; 16024#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16028#L25-1 assume true; 16051#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16050#L25-1 assume true; 16049#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16048#L25-1 assume true; 16047#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16045#L25-1 assume true; 16043#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16041#L25-1 assume true; 16039#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16037#L25-1 assume true; 16036#func_to_recursive_line_25_to_25_0EXIT >#80#return; 16029#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 16008#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 16019#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 16006#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 16009#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16023#L25-1 assume true; 16024#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16028#L25-1 assume true; 16051#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16050#L25-1 assume true; 16049#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16048#L25-1 assume true; 16047#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16045#L25-1 assume true; 16043#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16041#L25-1 assume true; 16039#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16037#L25-1 assume true; 16036#func_to_recursive_line_25_to_25_0EXIT >#80#return; 16029#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 16008#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 16019#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 16006#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 16009#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 16021#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 16022#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 16033#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 16023#L25-1 assume true; 16024#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16028#L25-1 assume true; 16051#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16050#L25-1 assume true; 16049#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16048#L25-1 assume true; 16047#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16045#L25-1 assume true; 16043#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16041#L25-1 assume true; 16039#func_to_recursive_line_25_to_25_0EXIT >#92#return; 16037#L25-1 assume true; 16036#func_to_recursive_line_25_to_25_0EXIT >#80#return; 16029#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 16008#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 16019#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 16006#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 16010#L41-1 assume true; 16032#func_to_recursive_line_24_to_25_0EXIT >#82#return; 16026#L41-1 assume true; 16027#func_to_recursive_line_24_to_25_0EXIT >#82#return; 16059#L41-1 assume true; 16058#func_to_recursive_line_24_to_25_0EXIT >#82#return; 16057#L41-1 assume true; 16056#func_to_recursive_line_24_to_25_0EXIT >#82#return; 16055#L41-1 assume true; 16054#func_to_recursive_line_24_to_25_0EXIT >#82#return; 16053#L41-1 assume true; 16052#func_to_recursive_line_24_to_25_0EXIT >#84#return; 16030#L67-1 call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 16003#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 16005#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 16025#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 16011#L61-1 assume true; 16012#func_to_recursive_line_23_to_24_0EXIT >#86#return; 16016#L61-1 assume true; 16046#func_to_recursive_line_23_to_24_0EXIT >#86#return; 16044#L61-1 assume true; 16042#func_to_recursive_line_23_to_24_0EXIT >#86#return; 16040#L61-1 assume true; 16038#func_to_recursive_line_23_to_24_0EXIT >#86#return; 16035#L61-1 assume true; 16034#func_to_recursive_line_23_to_24_0EXIT >#88#return; 16020#L87-1 call #t~mem14 := read~int#2(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 16013#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 16015#$Ultimate##0 [2024-10-12 01:02:18,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:02:18,168 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 10 times [2024-10-12 01:02:18,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:02:18,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584088021] [2024-10-12 01:02:18,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:02:18,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:02:18,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:02:18,181 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:02:18,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:02:18,190 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:02:18,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:02:18,191 INFO L85 PathProgramCache]: Analyzing trace with hash -531250216, now seen corresponding path program 7 times [2024-10-12 01:02:18,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:02:18,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439389046] [2024-10-12 01:02:18,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:02:18,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:02:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:25,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:25,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:30,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:31,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:31,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:31,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:31,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:31,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:31,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:31,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:31,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:31,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:31,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:31,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:31,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:31,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:32,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:32,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:32,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:32,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:32,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:32,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:32,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:32,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:32,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:32,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:32,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:32,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:32,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:32,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:33,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:33,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:33,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:33,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:33,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:33,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:33,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:33,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:33,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:33,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:33,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:33,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:33,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:33,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:33,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:33,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:33,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:33,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:33,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:33,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:33,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:33,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:33,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:33,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:33,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:33,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:33,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:33,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:33,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:33,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:33,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:33,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:33,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:33,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:33,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:33,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:33,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:33,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:33,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:33,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:33,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:33,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:33,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:33,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:33,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-12 01:02:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:34,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-12 01:02:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:34,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:34,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:34,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:34,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-12 01:02:34,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:34,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:34,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:35,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:35,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:35,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:35,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:35,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:35,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:35,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:35,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:35,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:35,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:35,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:35,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:35,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:35,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:35,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:35,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:35,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:35,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:35,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:35,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:35,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:35,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:35,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:35,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:35,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:35,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:35,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:35,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:35,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:35,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:35,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:35,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:35,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:35,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:35,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:35,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:35,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:35,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:35,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:35,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:35,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:35,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:35,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:35,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:35,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:35,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:35,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:35,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:35,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:35,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 01:02:35,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:35,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 01:02:35,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:35,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-12 01:02:35,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:35,287 INFO L134 CoverageAnalysis]: Checked inductivity of 47792 backedges. 24 proven. 593 refuted. 0 times theorem prover too weak. 47175 trivial. 0 not checked. [2024-10-12 01:02:35,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:02:35,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439389046] [2024-10-12 01:02:35,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439389046] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 01:02:35,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725381135] [2024-10-12 01:02:35,287 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-12 01:02:35,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 01:02:35,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:02:35,290 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 01:02:35,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-12 01:02:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:02:36,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 4960 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-10-12 01:02:36,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:02:36,384 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-12 01:02:36,774 INFO L134 CoverageAnalysis]: Checked inductivity of 47792 backedges. 674 proven. 35 refuted. 0 times theorem prover too weak. 47083 trivial. 0 not checked. [2024-10-12 01:02:36,775 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 01:02:42,756 INFO L134 CoverageAnalysis]: Checked inductivity of 47792 backedges. 674 proven. 90 refuted. 0 times theorem prover too weak. 47028 trivial. 0 not checked. [2024-10-12 01:02:42,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725381135] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 01:02:42,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 01:02:42,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 26] total 45 [2024-10-12 01:02:42,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6308643] [2024-10-12 01:02:42,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 01:02:42,759 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:02:42,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:02:42,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-10-12 01:02:42,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=1618, Unknown=0, NotChecked=0, Total=1980 [2024-10-12 01:02:42,761 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. cyclomatic complexity: 10 Second operand has 45 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 35 states have internal predecessors, (68), 19 states have call successors, (35), 12 states have call predecessors, (35), 15 states have return successors, (34), 20 states have call predecessors, (34), 19 states have call successors, (34) [2024-10-12 01:02:43,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:02:43,280 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2024-10-12 01:02:43,280 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 65 transitions. [2024-10-12 01:02:43,281 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-10-12 01:02:43,282 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 59 states and 65 transitions. [2024-10-12 01:02:43,283 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2024-10-12 01:02:43,283 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2024-10-12 01:02:43,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 65 transitions. [2024-10-12 01:02:43,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:02:43,287 INFO L218 hiAutomatonCegarLoop]: Abstraction has 59 states and 65 transitions. [2024-10-12 01:02:43,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 65 transitions. [2024-10-12 01:02:43,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-12 01:02:43,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 32 states have (on average 1.09375) internal successors, (35), 35 states have internal predecessors, (35), 8 states have call successors, (8), 4 states have call predecessors, (8), 19 states have return successors, (22), 19 states have call predecessors, (22), 6 states have call successors, (22) [2024-10-12 01:02:43,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2024-10-12 01:02:43,295 INFO L240 hiAutomatonCegarLoop]: Abstraction has 59 states and 65 transitions. [2024-10-12 01:02:43,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 01:02:43,300 INFO L425 stractBuchiCegarLoop]: Abstraction has 59 states and 65 transitions. [2024-10-12 01:02:43,300 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-12 01:02:43,300 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 65 transitions. [2024-10-12 01:02:43,301 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-10-12 01:02:43,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:02:43,301 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:02:43,312 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-12 01:02:43,312 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [168, 168, 144, 144, 144, 28, 28, 24, 24, 24, 24, 24, 24, 24, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:02:43,313 INFO L745 eck$LassoCheckResult]: Stem: 28839#$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); 28826#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(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#1(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#4(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 28822#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 28823#$Ultimate##0 [2024-10-12 01:02:43,314 INFO L747 eck$LassoCheckResult]: Loop: 28823#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#2(~a.base, ~a.offset, 4); 28825#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~b.base, ~b.offset, 4); 28812#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 28813#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 28833#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 28816#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 28827#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 28814#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 28817#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 28831#L25-1 assume true; 28832#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28836#L25-1 assume true; 28859#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28858#L25-1 assume true; 28857#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28856#L25-1 assume true; 28855#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28853#L25-1 assume true; 28851#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28849#L25-1 assume true; 28847#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28845#L25-1 assume true; 28844#func_to_recursive_line_25_to_25_0EXIT >#80#return; 28837#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 28815#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 28827#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 28814#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 28817#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 28831#L25-1 assume true; 28832#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28836#L25-1 assume true; 28859#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28858#L25-1 assume true; 28857#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28856#L25-1 assume true; 28855#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28853#L25-1 assume true; 28851#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28849#L25-1 assume true; 28847#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28845#L25-1 assume true; 28844#func_to_recursive_line_25_to_25_0EXIT >#80#return; 28837#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 28815#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 28827#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 28814#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 28817#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 28831#L25-1 assume true; 28832#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28836#L25-1 assume true; 28859#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28858#L25-1 assume true; 28857#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28856#L25-1 assume true; 28855#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28853#L25-1 assume true; 28851#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28849#L25-1 assume true; 28847#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28845#L25-1 assume true; 28844#func_to_recursive_line_25_to_25_0EXIT >#80#return; 28837#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 28815#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 28827#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 28814#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 28817#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 28831#L25-1 assume true; 28832#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28836#L25-1 assume true; 28859#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28858#L25-1 assume true; 28857#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28856#L25-1 assume true; 28855#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28853#L25-1 assume true; 28851#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28849#L25-1 assume true; 28847#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28845#L25-1 assume true; 28844#func_to_recursive_line_25_to_25_0EXIT >#80#return; 28837#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 28815#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 28827#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 28814#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 28817#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 28831#L25-1 assume true; 28832#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28836#L25-1 assume true; 28859#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28858#L25-1 assume true; 28857#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28856#L25-1 assume true; 28855#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28853#L25-1 assume true; 28851#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28849#L25-1 assume true; 28847#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28845#L25-1 assume true; 28844#func_to_recursive_line_25_to_25_0EXIT >#80#return; 28837#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 28815#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 28827#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 28814#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 28817#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 28831#L25-1 assume true; 28832#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28836#L25-1 assume true; 28859#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28858#L25-1 assume true; 28857#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28856#L25-1 assume true; 28855#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28853#L25-1 assume true; 28851#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28849#L25-1 assume true; 28847#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28845#L25-1 assume true; 28844#func_to_recursive_line_25_to_25_0EXIT >#80#return; 28837#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 28815#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 28827#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 28814#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 28818#L41-1 assume true; 28840#func_to_recursive_line_24_to_25_0EXIT >#82#return; 28834#L41-1 assume true; 28835#func_to_recursive_line_24_to_25_0EXIT >#82#return; 28869#L41-1 assume true; 28868#func_to_recursive_line_24_to_25_0EXIT >#82#return; 28867#L41-1 assume true; 28866#func_to_recursive_line_24_to_25_0EXIT >#82#return; 28865#L41-1 assume true; 28864#func_to_recursive_line_24_to_25_0EXIT >#82#return; 28863#L41-1 assume true; 28862#func_to_recursive_line_24_to_25_0EXIT >#82#return; 28861#L41-1 assume true; 28860#func_to_recursive_line_24_to_25_0EXIT >#84#return; 28838#L67-1 call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 28811#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 28813#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 28833#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 28816#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 28827#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 28814#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 28817#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 28831#L25-1 assume true; 28832#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28836#L25-1 assume true; 28859#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28858#L25-1 assume true; 28857#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28856#L25-1 assume true; 28855#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28853#L25-1 assume true; 28851#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28849#L25-1 assume true; 28847#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28845#L25-1 assume true; 28844#func_to_recursive_line_25_to_25_0EXIT >#80#return; 28837#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 28815#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 28827#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 28814#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 28817#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 28831#L25-1 assume true; 28832#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28836#L25-1 assume true; 28859#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28858#L25-1 assume true; 28857#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28856#L25-1 assume true; 28855#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28853#L25-1 assume true; 28851#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28849#L25-1 assume true; 28847#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28845#L25-1 assume true; 28844#func_to_recursive_line_25_to_25_0EXIT >#80#return; 28837#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 28815#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 28827#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 28814#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 28817#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 28831#L25-1 assume true; 28832#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28836#L25-1 assume true; 28859#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28858#L25-1 assume true; 28857#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28856#L25-1 assume true; 28855#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28853#L25-1 assume true; 28851#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28849#L25-1 assume true; 28847#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28845#L25-1 assume true; 28844#func_to_recursive_line_25_to_25_0EXIT >#80#return; 28837#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 28815#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 28827#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 28814#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 28817#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 28831#L25-1 assume true; 28832#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28836#L25-1 assume true; 28859#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28858#L25-1 assume true; 28857#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28856#L25-1 assume true; 28855#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28853#L25-1 assume true; 28851#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28849#L25-1 assume true; 28847#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28845#L25-1 assume true; 28844#func_to_recursive_line_25_to_25_0EXIT >#80#return; 28837#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 28815#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 28827#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 28814#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 28817#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 28831#L25-1 assume true; 28832#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28836#L25-1 assume true; 28859#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28858#L25-1 assume true; 28857#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28856#L25-1 assume true; 28855#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28853#L25-1 assume true; 28851#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28849#L25-1 assume true; 28847#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28845#L25-1 assume true; 28844#func_to_recursive_line_25_to_25_0EXIT >#80#return; 28837#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 28815#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 28827#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 28814#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 28817#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 28831#L25-1 assume true; 28832#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28836#L25-1 assume true; 28859#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28858#L25-1 assume true; 28857#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28856#L25-1 assume true; 28855#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28853#L25-1 assume true; 28851#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28849#L25-1 assume true; 28847#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28845#L25-1 assume true; 28844#func_to_recursive_line_25_to_25_0EXIT >#80#return; 28837#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 28815#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 28827#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 28814#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 28818#L41-1 assume true; 28840#func_to_recursive_line_24_to_25_0EXIT >#82#return; 28834#L41-1 assume true; 28835#func_to_recursive_line_24_to_25_0EXIT >#82#return; 28869#L41-1 assume true; 28868#func_to_recursive_line_24_to_25_0EXIT >#82#return; 28867#L41-1 assume true; 28866#func_to_recursive_line_24_to_25_0EXIT >#82#return; 28865#L41-1 assume true; 28864#func_to_recursive_line_24_to_25_0EXIT >#82#return; 28863#L41-1 assume true; 28862#func_to_recursive_line_24_to_25_0EXIT >#82#return; 28861#L41-1 assume true; 28860#func_to_recursive_line_24_to_25_0EXIT >#84#return; 28838#L67-1 call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 28811#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 28813#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 28833#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 28816#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 28827#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 28814#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 28817#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 28831#L25-1 assume true; 28832#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28836#L25-1 assume true; 28859#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28858#L25-1 assume true; 28857#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28856#L25-1 assume true; 28855#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28853#L25-1 assume true; 28851#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28849#L25-1 assume true; 28847#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28845#L25-1 assume true; 28844#func_to_recursive_line_25_to_25_0EXIT >#80#return; 28837#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 28815#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 28827#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 28814#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 28817#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 28831#L25-1 assume true; 28832#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28836#L25-1 assume true; 28859#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28858#L25-1 assume true; 28857#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28856#L25-1 assume true; 28855#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28853#L25-1 assume true; 28851#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28849#L25-1 assume true; 28847#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28845#L25-1 assume true; 28844#func_to_recursive_line_25_to_25_0EXIT >#80#return; 28837#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 28815#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 28827#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 28814#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 28817#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 28831#L25-1 assume true; 28832#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28836#L25-1 assume true; 28859#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28858#L25-1 assume true; 28857#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28856#L25-1 assume true; 28855#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28853#L25-1 assume true; 28851#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28849#L25-1 assume true; 28847#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28845#L25-1 assume true; 28844#func_to_recursive_line_25_to_25_0EXIT >#80#return; 28837#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 28815#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 28827#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 28814#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 28817#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 28831#L25-1 assume true; 28832#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28836#L25-1 assume true; 28859#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28858#L25-1 assume true; 28857#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28856#L25-1 assume true; 28855#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28853#L25-1 assume true; 28851#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28849#L25-1 assume true; 28847#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28845#L25-1 assume true; 28844#func_to_recursive_line_25_to_25_0EXIT >#80#return; 28837#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 28815#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 28827#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 28814#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 28817#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 28831#L25-1 assume true; 28832#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28836#L25-1 assume true; 28859#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28858#L25-1 assume true; 28857#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28856#L25-1 assume true; 28855#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28853#L25-1 assume true; 28851#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28849#L25-1 assume true; 28847#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28845#L25-1 assume true; 28844#func_to_recursive_line_25_to_25_0EXIT >#80#return; 28837#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 28815#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 28827#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 28814#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 28817#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 28831#L25-1 assume true; 28832#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28836#L25-1 assume true; 28859#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28858#L25-1 assume true; 28857#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28856#L25-1 assume true; 28855#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28853#L25-1 assume true; 28851#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28849#L25-1 assume true; 28847#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28845#L25-1 assume true; 28844#func_to_recursive_line_25_to_25_0EXIT >#80#return; 28837#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 28815#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 28827#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 28814#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 28818#L41-1 assume true; 28840#func_to_recursive_line_24_to_25_0EXIT >#82#return; 28834#L41-1 assume true; 28835#func_to_recursive_line_24_to_25_0EXIT >#82#return; 28869#L41-1 assume true; 28868#func_to_recursive_line_24_to_25_0EXIT >#82#return; 28867#L41-1 assume true; 28866#func_to_recursive_line_24_to_25_0EXIT >#82#return; 28865#L41-1 assume true; 28864#func_to_recursive_line_24_to_25_0EXIT >#82#return; 28863#L41-1 assume true; 28862#func_to_recursive_line_24_to_25_0EXIT >#82#return; 28861#L41-1 assume true; 28860#func_to_recursive_line_24_to_25_0EXIT >#84#return; 28838#L67-1 call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 28811#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 28813#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 28833#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4); 28816#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 28827#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 28814#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 28817#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 28831#L25-1 assume true; 28832#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28836#L25-1 assume true; 28859#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28858#L25-1 assume true; 28857#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28856#L25-1 assume true; 28855#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28853#L25-1 assume true; 28851#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28849#L25-1 assume true; 28847#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28845#L25-1 assume true; 28844#func_to_recursive_line_25_to_25_0EXIT >#80#return; 28837#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 28815#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 28827#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 28814#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 28817#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 28831#L25-1 assume true; 28832#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28836#L25-1 assume true; 28859#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28858#L25-1 assume true; 28857#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28856#L25-1 assume true; 28855#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28853#L25-1 assume true; 28851#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28849#L25-1 assume true; 28847#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28845#L25-1 assume true; 28844#func_to_recursive_line_25_to_25_0EXIT >#80#return; 28837#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 28815#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 28827#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 28814#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 28817#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 28831#L25-1 assume true; 28832#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28836#L25-1 assume true; 28859#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28858#L25-1 assume true; 28857#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28856#L25-1 assume true; 28855#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28853#L25-1 assume true; 28851#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28849#L25-1 assume true; 28847#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28845#L25-1 assume true; 28844#func_to_recursive_line_25_to_25_0EXIT >#80#return; 28837#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 28815#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 28827#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 28814#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 28817#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 28831#L25-1 assume true; 28832#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28836#L25-1 assume true; 28859#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28858#L25-1 assume true; 28857#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28856#L25-1 assume true; 28855#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28853#L25-1 assume true; 28851#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28849#L25-1 assume true; 28847#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28845#L25-1 assume true; 28844#func_to_recursive_line_25_to_25_0EXIT >#80#return; 28837#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 28815#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 28827#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 28814#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 28817#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 28831#L25-1 assume true; 28832#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28836#L25-1 assume true; 28859#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28858#L25-1 assume true; 28857#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28856#L25-1 assume true; 28855#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28853#L25-1 assume true; 28851#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28849#L25-1 assume true; 28847#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28845#L25-1 assume true; 28844#func_to_recursive_line_25_to_25_0EXIT >#80#return; 28837#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 28815#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 28827#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 28814#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~d.base, ~d.offset, 4); 28817#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 28829#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 28830#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#4(~d.base, ~d.offset, 4); 28841#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 28831#L25-1 assume true; 28832#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28836#L25-1 assume true; 28859#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28858#L25-1 assume true; 28857#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28856#L25-1 assume true; 28855#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28853#L25-1 assume true; 28851#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28849#L25-1 assume true; 28847#func_to_recursive_line_25_to_25_0EXIT >#92#return; 28845#L25-1 assume true; 28844#func_to_recursive_line_25_to_25_0EXIT >#80#return; 28837#L47-1 call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 28815#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 28827#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#3(~c.base, ~c.offset, 4); 28814#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 28818#L41-1 assume true; 28840#func_to_recursive_line_24_to_25_0EXIT >#82#return; 28834#L41-1 assume true; 28835#func_to_recursive_line_24_to_25_0EXIT >#82#return; 28869#L41-1 assume true; 28868#func_to_recursive_line_24_to_25_0EXIT >#82#return; 28867#L41-1 assume true; 28866#func_to_recursive_line_24_to_25_0EXIT >#82#return; 28865#L41-1 assume true; 28864#func_to_recursive_line_24_to_25_0EXIT >#82#return; 28863#L41-1 assume true; 28862#func_to_recursive_line_24_to_25_0EXIT >#82#return; 28861#L41-1 assume true; 28860#func_to_recursive_line_24_to_25_0EXIT >#84#return; 28838#L67-1 call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 28811#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 28813#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 28833#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 28819#L61-1 assume true; 28820#func_to_recursive_line_23_to_24_0EXIT >#86#return; 28824#L61-1 assume true; 28854#func_to_recursive_line_23_to_24_0EXIT >#86#return; 28852#L61-1 assume true; 28850#func_to_recursive_line_23_to_24_0EXIT >#86#return; 28848#L61-1 assume true; 28846#func_to_recursive_line_23_to_24_0EXIT >#86#return; 28843#L61-1 assume true; 28842#func_to_recursive_line_23_to_24_0EXIT >#88#return; 28828#L87-1 call #t~mem14 := read~int#2(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 28821#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 28823#$Ultimate##0 [2024-10-12 01:02:43,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:02:43,317 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 11 times [2024-10-12 01:02:43,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:02:43,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026565583] [2024-10-12 01:02:43,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:02:43,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:02:43,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:02:43,338 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:02:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:02:43,354 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:02:43,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:02:43,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1880621056, now seen corresponding path program 8 times [2024-10-12 01:02:43,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:02:43,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476102644] [2024-10-12 01:02:43,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:02:43,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:02:43,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat