./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 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 45898d4df949634911027a72c0e1c79e1edaab63547cca5c16238cef1218e556 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-25 00:37:45,285 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-25 00:37:45,339 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-25 00:37:45,344 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-25 00:37:45,346 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-25 00:37:45,370 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-25 00:37:45,371 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-25 00:37:45,371 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-25 00:37:45,372 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-25 00:37:45,372 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-25 00:37:45,373 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-25 00:37:45,373 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-25 00:37:45,374 INFO L153 SettingsManager]: * Use SBE=true [2024-10-25 00:37:45,374 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-25 00:37:45,375 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-25 00:37:45,376 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-25 00:37:45,376 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-25 00:37:45,376 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-25 00:37:45,377 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-25 00:37:45,377 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-25 00:37:45,377 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-25 00:37:45,380 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-25 00:37:45,380 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-25 00:37:45,380 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-25 00:37:45,380 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-25 00:37:45,381 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-25 00:37:45,381 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-25 00:37:45,381 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-25 00:37:45,381 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-25 00:37:45,382 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-25 00:37:45,382 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-25 00:37:45,382 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-25 00:37:45,382 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-25 00:37:45,382 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-25 00:37:45,382 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-25 00:37:45,383 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-25 00:37:45,383 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-25 00:37:45,383 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-25 00:37:45,384 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-25 00:37:45,384 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 45898d4df949634911027a72c0e1c79e1edaab63547cca5c16238cef1218e556 [2024-10-25 00:37:45,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-25 00:37:45,624 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-25 00:37:45,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-25 00:37:45,628 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-25 00:37:45,628 INFO L274 PluginConnector]: CDTParser initialized [2024-10-25 00:37:45,629 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-25 00:37:47,185 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-25 00:37:47,383 INFO L384 CDTParser]: Found 1 translation units. [2024-10-25 00:37:47,384 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c [2024-10-25 00:37:47,390 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07ab33b02/72ec7fea42644058b9d614cb2ac27b88/FLAG9e39c90a3 [2024-10-25 00:37:47,418 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07ab33b02/72ec7fea42644058b9d614cb2ac27b88 [2024-10-25 00:37:47,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-25 00:37:47,425 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-25 00:37:47,427 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-25 00:37:47,430 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-25 00:37:47,434 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-25 00:37:47,435 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:37:47" (1/1) ... [2024-10-25 00:37:47,439 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@562f08e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:47, skipping insertion in model container [2024-10-25 00:37:47,439 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:37:47" (1/1) ... [2024-10-25 00:37:47,459 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-25 00:37:47,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-25 00:37:47,671 INFO L200 MainTranslator]: Completed pre-run [2024-10-25 00:37:47,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-25 00:37:47,722 INFO L204 MainTranslator]: Completed translation [2024-10-25 00:37:47,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:47 WrapperNode [2024-10-25 00:37:47,723 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-25 00:37:47,724 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-25 00:37:47,724 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-25 00:37:47,724 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-25 00:37:47,732 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:47" (1/1) ... [2024-10-25 00:37:47,743 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:47" (1/1) ... [2024-10-25 00:37:47,775 INFO L138 Inliner]: procedures = 15, calls = 52, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2024-10-25 00:37:47,776 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-25 00:37:47,777 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-25 00:37:47,777 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-25 00:37:47,778 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-25 00:37:47,788 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:47" (1/1) ... [2024-10-25 00:37:47,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:47" (1/1) ... [2024-10-25 00:37:47,792 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:47" (1/1) ... [2024-10-25 00:37:47,820 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-25 00:37:47,821 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:47" (1/1) ... [2024-10-25 00:37:47,822 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:47" (1/1) ... [2024-10-25 00:37:47,833 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:47" (1/1) ... [2024-10-25 00:37:47,840 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:47" (1/1) ... [2024-10-25 00:37:47,843 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:47" (1/1) ... [2024-10-25 00:37:47,848 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:47" (1/1) ... [2024-10-25 00:37:47,851 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-25 00:37:47,855 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-25 00:37:47,856 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-25 00:37:47,856 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-25 00:37:47,857 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:47" (1/1) ... [2024-10-25 00:37:47,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:37:47,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:37:47,895 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:37:47,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-25 00:37:47,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-25 00:37:47,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-25 00:37:47,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-25 00:37:47,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-25 00:37:47,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-25 00:37:47,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-25 00:37:47,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-25 00:37:47,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-25 00:37:47,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-25 00:37:47,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-25 00:37:47,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-25 00:37:47,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-25 00:37:47,936 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2024-10-25 00:37:47,936 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2024-10-25 00:37:47,936 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2024-10-25 00:37:47,936 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2024-10-25 00:37:47,936 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_22_to_23_0 [2024-10-25 00:37:47,936 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_22_to_23_0 [2024-10-25 00:37:47,936 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_25_0 [2024-10-25 00:37:47,937 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_25_0 [2024-10-25 00:37:47,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-25 00:37:47,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-25 00:37:47,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-25 00:37:47,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-25 00:37:47,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-25 00:37:47,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-25 00:37:47,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-25 00:37:47,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-25 00:37:48,012 INFO L238 CfgBuilder]: Building ICFG [2024-10-25 00:37:48,013 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-25 00:37:48,179 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-25 00:37:48,180 INFO L287 CfgBuilder]: Performing block encoding [2024-10-25 00:37:48,188 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-25 00:37:48,189 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-25 00:37:48,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:37:48 BoogieIcfgContainer [2024-10-25 00:37:48,189 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-25 00:37:48,190 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-25 00:37:48,190 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-25 00:37:48,193 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-25 00:37:48,194 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-25 00:37:48,194 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 25.10 12:37:47" (1/3) ... [2024-10-25 00:37:48,195 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c3200ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.10 12:37:48, skipping insertion in model container [2024-10-25 00:37:48,195 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-25 00:37:48,195 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:47" (2/3) ... [2024-10-25 00:37:48,199 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c3200ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.10 12:37:48, skipping insertion in model container [2024-10-25 00:37:48,199 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-25 00:37:48,199 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:37:48" (3/3) ... [2024-10-25 00:37:48,200 INFO L332 chiAutomizerObserver]: Analyzing ICFG recursified_nested_4.c [2024-10-25 00:37:48,253 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-25 00:37:48,254 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-25 00:37:48,254 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-25 00:37:48,254 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-25 00:37:48,254 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-25 00:37:48,254 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-25 00:37:48,254 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-25 00:37:48,255 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-25 00:37:48,260 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-25 00:37:48,276 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-10-25 00:37:48,277 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:37:48,277 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:37:48,282 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-25 00:37:48,283 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:37:48,283 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-25 00:37:48,283 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-25 00:37:48,286 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-10-25 00:37:48,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:37:48,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:37:48,287 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-25 00:37:48,287 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:37:48,293 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-25 00:37:48,293 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-25 00:37:48,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:48,298 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 1 times [2024-10-25 00:37:48,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:48,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556429937] [2024-10-25 00:37:48,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:48,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:48,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:48,457 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:37:48,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:48,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:37:48,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:48,513 INFO L85 PathProgramCache]: Analyzing trace with hash -448633028, now seen corresponding path program 1 times [2024-10-25 00:37:48,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:48,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457556443] [2024-10-25 00:37:48,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:48,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:48,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:48,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:48,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:48,904 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-25 00:37:48,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:37:48,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457556443] [2024-10-25 00:37:48,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457556443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:37:48,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:37:48,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-25 00:37:48,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507603343] [2024-10-25 00:37:48,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:37:48,912 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:37:48,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:37:48,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-25 00:37:48,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-25 00:37:48,980 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-25 00:37:49,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:37:49,228 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2024-10-25 00:37:49,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 61 transitions. [2024-10-25 00:37:49,234 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-10-25 00:37:49,241 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 33 states and 41 transitions. [2024-10-25 00:37:49,243 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2024-10-25 00:37:49,243 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2024-10-25 00:37:49,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2024-10-25 00:37:49,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:37:49,245 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 41 transitions. [2024-10-25 00:37:49,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2024-10-25 00:37:49,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2024-10-25 00:37:49,266 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-25 00:37:49,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-10-25 00:37:49,269 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-10-25 00:37:49,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 00:37:49,274 INFO L425 stractBuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-10-25 00:37:49,275 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-25 00:37:49,277 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2024-10-25 00:37:49,278 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-10-25 00:37:49,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:37:49,278 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:37:49,279 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-25 00:37:49,279 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-25 00:37:49,279 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-25 00:37:49,279 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-25 00:37:49,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:49,280 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 2 times [2024-10-25 00:37:49,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:49,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921462861] [2024-10-25 00:37:49,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:49,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:49,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:49,292 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:37:49,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:49,301 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:37:49,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:49,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1860565822, now seen corresponding path program 1 times [2024-10-25 00:37:49,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:49,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575621053] [2024-10-25 00:37:49,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:49,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:49,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:49,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:49,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:49,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-25 00:37:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:49,533 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-25 00:37:49,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:37:49,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575621053] [2024-10-25 00:37:49,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575621053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:37:49,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:37:49,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-25 00:37:49,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811547969] [2024-10-25 00:37:49,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:37:49,536 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:37:49,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:37:49,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-25 00:37:49,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-25 00:37:49,537 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-25 00:37:49,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:37:49,662 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2024-10-25 00:37:49,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 40 transitions. [2024-10-25 00:37:49,663 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-10-25 00:37:49,665 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 40 transitions. [2024-10-25 00:37:49,667 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2024-10-25 00:37:49,667 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2024-10-25 00:37:49,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 40 transitions. [2024-10-25 00:37:49,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:37:49,668 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 40 transitions. [2024-10-25 00:37:49,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 40 transitions. [2024-10-25 00:37:49,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2024-10-25 00:37:49,670 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-25 00:37:49,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-10-25 00:37:49,671 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-10-25 00:37:49,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-25 00:37:49,673 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-10-25 00:37:49,673 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-25 00:37:49,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2024-10-25 00:37:49,674 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-10-25 00:37:49,675 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:37:49,675 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:37:49,675 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-25 00:37:49,676 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-25 00:37:49,676 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-25 00:37:49,677 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-25 00:37:49,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:49,677 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 3 times [2024-10-25 00:37:49,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:49,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293509073] [2024-10-25 00:37:49,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:49,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:49,694 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:37:49,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:49,707 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:37:49,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:49,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1780666575, now seen corresponding path program 1 times [2024-10-25 00:37:49,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:49,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430029828] [2024-10-25 00:37:49,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:49,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:49,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:49,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:49,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:49,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:49,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:49,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:50,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-25 00:37:50,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:50,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-25 00:37:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:50,047 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-25 00:37:50,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:37:50,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430029828] [2024-10-25 00:37:50,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430029828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:37:50,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:37:50,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-25 00:37:50,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227028183] [2024-10-25 00:37:50,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:37:50,049 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:37:50,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:37:50,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-25 00:37:50,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-25 00:37:50,050 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-25 00:37:50,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:37:50,167 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2024-10-25 00:37:50,167 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 39 transitions. [2024-10-25 00:37:50,168 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-10-25 00:37:50,169 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 39 transitions. [2024-10-25 00:37:50,169 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2024-10-25 00:37:50,169 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2024-10-25 00:37:50,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 39 transitions. [2024-10-25 00:37:50,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:37:50,170 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-10-25 00:37:50,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 39 transitions. [2024-10-25 00:37:50,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-25 00:37:50,175 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-25 00:37:50,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2024-10-25 00:37:50,177 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-10-25 00:37:50,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-25 00:37:50,180 INFO L425 stractBuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-10-25 00:37:50,180 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-25 00:37:50,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 39 transitions. [2024-10-25 00:37:50,182 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-10-25 00:37:50,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:37:50,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:37:50,184 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-25 00:37:50,184 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-25 00:37:50,185 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-25 00:37:50,185 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-25 00:37:50,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:50,186 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 4 times [2024-10-25 00:37:50,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:50,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565203479] [2024-10-25 00:37:50,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:50,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:50,206 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:37:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:50,222 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:37:50,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:50,224 INFO L85 PathProgramCache]: Analyzing trace with hash -971158242, now seen corresponding path program 1 times [2024-10-25 00:37:50,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:50,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858364984] [2024-10-25 00:37:50,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:50,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:50,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:50,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:50,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:50,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:50,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:50,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:51,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:51,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:37:51,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:51,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-25 00:37:51,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:51,164 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-25 00:37:51,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:37:51,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858364984] [2024-10-25 00:37:51,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858364984] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:37:51,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302228298] [2024-10-25 00:37:51,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:51,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:37:51,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:37:51,170 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 00:37:51,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-25 00:37:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:51,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-25 00:37:51,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:37:51,308 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-25 00:37:51,538 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-25 00:37:51,538 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:37:52,161 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-25 00:37:52,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302228298] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:37:52,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:37:52,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 23 [2024-10-25 00:37:52,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334223959] [2024-10-25 00:37:52,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:37:52,163 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:37:52,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:37:52,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-25 00:37:52,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2024-10-25 00:37:52,164 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-25 00:37:52,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:37:52,480 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2024-10-25 00:37:52,480 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 43 transitions. [2024-10-25 00:37:52,481 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-10-25 00:37:52,482 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 43 transitions. [2024-10-25 00:37:52,482 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2024-10-25 00:37:52,482 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2024-10-25 00:37:52,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 43 transitions. [2024-10-25 00:37:52,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:37:52,483 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-10-25 00:37:52,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 43 transitions. [2024-10-25 00:37:52,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-25 00:37:52,485 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-25 00:37:52,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2024-10-25 00:37:52,486 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-10-25 00:37:52,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-25 00:37:52,489 INFO L425 stractBuchiCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-10-25 00:37:52,489 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-25 00:37:52,489 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 43 transitions. [2024-10-25 00:37:52,490 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-10-25 00:37:52,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:37:52,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:37:52,491 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-25 00:37:52,491 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-25 00:37:52,491 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-25 00:37:52,491 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-25 00:37:52,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:52,492 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 5 times [2024-10-25 00:37:52,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:52,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389675474] [2024-10-25 00:37:52,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:52,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:52,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:52,503 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:37:52,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:52,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:37:52,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:52,511 INFO L85 PathProgramCache]: Analyzing trace with hash -2092880572, now seen corresponding path program 2 times [2024-10-25 00:37:52,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:52,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682947616] [2024-10-25 00:37:52,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:52,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:52,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:52,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:52,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:53,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:53,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:53,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:53,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:53,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:53,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:53,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:53,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:53,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:53,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-25 00:37:53,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:53,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-25 00:37:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:53,837 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-25 00:37:53,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:37:53,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682947616] [2024-10-25 00:37:53,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682947616] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:37:53,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378568917] [2024-10-25 00:37:53,838 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-25 00:37:53,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:37:53,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:37:53,846 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 00:37:53,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-25 00:37:53,953 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-25 00:37:53,953 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 00:37:53,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-25 00:37:53,962 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:37:53,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-25 00:37:54,133 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-25 00:37:54,134 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:37:54,501 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-25 00:37:54,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378568917] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:37:54,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:37:54,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 10] total 30 [2024-10-25 00:37:54,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428597066] [2024-10-25 00:37:54,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:37:54,503 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:37:54,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:37:54,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-25 00:37:54,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=757, Unknown=0, NotChecked=0, Total=870 [2024-10-25 00:37:54,504 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-25 00:37:55,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:37:55,027 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2024-10-25 00:37:55,028 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 47 transitions. [2024-10-25 00:37:55,029 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-10-25 00:37:55,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 47 transitions. [2024-10-25 00:37:55,029 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2024-10-25 00:37:55,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2024-10-25 00:37:55,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 47 transitions. [2024-10-25 00:37:55,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:37:55,030 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-10-25 00:37:55,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 47 transitions. [2024-10-25 00:37:55,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-25 00:37:55,033 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-25 00:37:55,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2024-10-25 00:37:55,033 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-10-25 00:37:55,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-25 00:37:55,034 INFO L425 stractBuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-10-25 00:37:55,034 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-25 00:37:55,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 47 transitions. [2024-10-25 00:37:55,035 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-10-25 00:37:55,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:37:55,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:37:55,036 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-25 00:37:55,036 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-25 00:37:55,037 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-25 00:37:55,037 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-25 00:37:55,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:55,038 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 6 times [2024-10-25 00:37:55,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:55,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473502547] [2024-10-25 00:37:55,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:55,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:55,045 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:37:55,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:55,050 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:37:55,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:55,051 INFO L85 PathProgramCache]: Analyzing trace with hash -501865090, now seen corresponding path program 3 times [2024-10-25 00:37:55,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:55,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652118046] [2024-10-25 00:37:55,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:55,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:55,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:55,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:55,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:55,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:55,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:55,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:55,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:55,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:55,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:55,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:55,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:55,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:55,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:37:55,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:55,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-25 00:37:55,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:55,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:55,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:55,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:55,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:55,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:55,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:55,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:55,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:55,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:55,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:55,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:55,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:37:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:55,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-25 00:37:55,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:55,815 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-25 00:37:55,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:37:55,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652118046] [2024-10-25 00:37:55,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652118046] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:37:55,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073428026] [2024-10-25 00:37:55,816 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-25 00:37:55,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:37:55,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:37:55,821 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 00:37:55,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-25 00:37:55,937 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-25 00:37:55,937 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 00:37:55,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-25 00:37:55,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:37:55,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-25 00:37:56,212 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-25 00:37:56,212 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:37:57,002 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-25 00:37:57,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073428026] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:37:57,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:37:57,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 14] total 31 [2024-10-25 00:37:57,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045794062] [2024-10-25 00:37:57,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:37:57,004 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:37:57,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:37:57,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-25 00:37:57,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=792, Unknown=0, NotChecked=0, Total=930 [2024-10-25 00:37:57,004 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-25 00:37:57,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:37:57,428 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2024-10-25 00:37:57,429 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 51 transitions. [2024-10-25 00:37:57,429 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-10-25 00:37:57,430 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 51 transitions. [2024-10-25 00:37:57,430 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2024-10-25 00:37:57,430 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2024-10-25 00:37:57,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 51 transitions. [2024-10-25 00:37:57,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:37:57,431 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 51 transitions. [2024-10-25 00:37:57,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 51 transitions. [2024-10-25 00:37:57,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-25 00:37:57,435 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-25 00:37:57,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2024-10-25 00:37:57,436 INFO L240 hiAutomatonCegarLoop]: Abstraction has 45 states and 51 transitions. [2024-10-25 00:37:57,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-25 00:37:57,438 INFO L425 stractBuchiCegarLoop]: Abstraction has 45 states and 51 transitions. [2024-10-25 00:37:57,438 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-25 00:37:57,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 51 transitions. [2024-10-25 00:37:57,442 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-10-25 00:37:57,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:37:57,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:37:57,445 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-25 00:37:57,445 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-25 00:37:57,446 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-25 00:37:57,446 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-25 00:37:57,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:57,447 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 7 times [2024-10-25 00:37:57,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:57,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711551603] [2024-10-25 00:37:57,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:57,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:57,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:57,456 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:37:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:57,461 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:37:57,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:57,462 INFO L85 PathProgramCache]: Analyzing trace with hash 990602320, now seen corresponding path program 4 times [2024-10-25 00:37:57,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:57,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314469431] [2024-10-25 00:37:57,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:57,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:57,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:58,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:58,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:59,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:59,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:00,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:00,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-25 00:38:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:01,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:01,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:01,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:01,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:01,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:01,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:01,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:01,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:01,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:01,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:01,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:01,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:01,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:01,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:01,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:01,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-25 00:38:01,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:01,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:01,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:01,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:01,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:01,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:01,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:01,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:01,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:01,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:01,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:01,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:01,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:01,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:01,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:01,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:01,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:01,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:01,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:01,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:01,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:38:01,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:01,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-25 00:38:01,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:01,179 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-25 00:38:01,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:38:01,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314469431] [2024-10-25 00:38:01,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314469431] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:38:01,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011551416] [2024-10-25 00:38:01,180 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-25 00:38:01,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:38:01,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:01,183 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 00:38:01,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-25 00:38:01,490 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-25 00:38:01,491 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 00:38:01,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 1388 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-10-25 00:38:01,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:38:01,631 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-25 00:38:02,166 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-25 00:38:02,166 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:38:06,003 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-25 00:38:06,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011551416] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:38:06,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:38:06,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 22] total 47 [2024-10-25 00:38:06,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413097656] [2024-10-25 00:38:06,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:38:06,006 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:38:06,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:38:06,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-10-25 00:38:06,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=1839, Unknown=0, NotChecked=0, Total=2162 [2024-10-25 00:38:06,008 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-25 00:38:06,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:38:06,763 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2024-10-25 00:38:06,763 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 55 transitions. [2024-10-25 00:38:06,764 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-10-25 00:38:06,766 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 55 transitions. [2024-10-25 00:38:06,766 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2024-10-25 00:38:06,766 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2024-10-25 00:38:06,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 55 transitions. [2024-10-25 00:38:06,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:38:06,767 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 55 transitions. [2024-10-25 00:38:06,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 55 transitions. [2024-10-25 00:38:06,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-25 00:38:06,770 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-25 00:38:06,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2024-10-25 00:38:06,771 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 55 transitions. [2024-10-25 00:38:06,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-25 00:38:06,772 INFO L425 stractBuchiCegarLoop]: Abstraction has 49 states and 55 transitions. [2024-10-25 00:38:06,773 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-25 00:38:06,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 55 transitions. [2024-10-25 00:38:06,773 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-10-25 00:38:06,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:38:06,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:38:06,777 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-25 00:38:06,778 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-25 00:38:06,778 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-25 00:38:06,779 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-25 00:38:06,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:38:06,779 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 8 times [2024-10-25 00:38:06,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:38:06,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458321412] [2024-10-25 00:38:06,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:38:06,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:38:06,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:06,789 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:38:06,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:06,795 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:38:06,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:38:06,796 INFO L85 PathProgramCache]: Analyzing trace with hash 732034000, now seen corresponding path program 5 times [2024-10-25 00:38:06,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:38:06,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142856959] [2024-10-25 00:38:06,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:38:06,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:38:06,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:07,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:08,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:08,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:38:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:38:09,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-25 00:38:09,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:38:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:38:09,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-25 00:38:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:38:09,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:38:09,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-25 00:38:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:09,907 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-25 00:38:09,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:38:09,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142856959] [2024-10-25 00:38:09,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142856959] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:38:09,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025274101] [2024-10-25 00:38:09,908 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-25 00:38:09,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:38:09,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:09,909 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 00:38:09,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-25 00:38:14,924 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2024-10-25 00:38:14,924 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 00:38:14,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 1526 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-25 00:38:14,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:38:14,962 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-25 00:38:15,143 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-25 00:38:15,144 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:38:16,422 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-25 00:38:16,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025274101] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:38:16,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:38:16,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 14] total 31 [2024-10-25 00:38:16,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025312506] [2024-10-25 00:38:16,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:38:16,424 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:38:16,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:38:16,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-25 00:38:16,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2024-10-25 00:38:16,425 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-25 00:38:16,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:38:16,711 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2024-10-25 00:38:16,711 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 59 transitions. [2024-10-25 00:38:16,712 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-10-25 00:38:16,713 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 59 transitions. [2024-10-25 00:38:16,713 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2024-10-25 00:38:16,713 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2024-10-25 00:38:16,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 59 transitions. [2024-10-25 00:38:16,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:38:16,714 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 59 transitions. [2024-10-25 00:38:16,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 59 transitions. [2024-10-25 00:38:16,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-25 00:38:16,716 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-25 00:38:16,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2024-10-25 00:38:16,716 INFO L240 hiAutomatonCegarLoop]: Abstraction has 53 states and 59 transitions. [2024-10-25 00:38:16,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-25 00:38:16,717 INFO L425 stractBuchiCegarLoop]: Abstraction has 53 states and 59 transitions. [2024-10-25 00:38:16,717 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-25 00:38:16,717 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 59 transitions. [2024-10-25 00:38:16,718 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-10-25 00:38:16,718 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:38:16,718 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:38:16,720 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-25 00:38:16,720 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-25 00:38:16,721 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-25 00:38:16,721 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-25 00:38:16,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:38:16,722 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 9 times [2024-10-25 00:38:16,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:38:16,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420448104] [2024-10-25 00:38:16,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:38:16,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:38:16,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:16,729 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:38:16,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:16,737 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:38:16,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:38:16,737 INFO L85 PathProgramCache]: Analyzing trace with hash 24421248, now seen corresponding path program 6 times [2024-10-25 00:38:16,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:38:16,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498619277] [2024-10-25 00:38:16,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:38:16,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:38:16,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:18,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:18,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:20,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:20,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:21,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:21,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:21,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:21,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:21,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:38:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:21,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:21,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:21,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:21,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:21,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:21,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:21,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:38:21,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:38:22,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:38:22,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-25 00:38:22,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:38:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:38:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:38:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:38:22,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-25 00:38:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:38:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:38:22,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:38:22,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:22,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:38:22,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-25 00:38:22,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:22,897 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-25 00:38:22,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:38:22,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498619277] [2024-10-25 00:38:22,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498619277] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:38:22,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364739679] [2024-10-25 00:38:22,897 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-25 00:38:22,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:38:22,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:22,900 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 00:38:22,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-25 00:38:23,272 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-10-25 00:38:23,272 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 00:38:23,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-10-25 00:38:23,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:38:23,288 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-25 00:38:23,539 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-25 00:38:23,540 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:38:25,643 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-25 00:38:25,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364739679] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:38:25,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:38:25,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 18] total 39 [2024-10-25 00:38:25,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11765991] [2024-10-25 00:38:25,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:38:25,645 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:38:25,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:38:25,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-10-25 00:38:25,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1276, Unknown=0, NotChecked=0, Total=1482 [2024-10-25 00:38:25,649 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-25 00:38:26,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:38:26,148 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2024-10-25 00:38:26,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 63 transitions. [2024-10-25 00:38:26,149 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-10-25 00:38:26,149 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 57 states and 63 transitions. [2024-10-25 00:38:26,150 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2024-10-25 00:38:26,150 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2024-10-25 00:38:26,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 63 transitions. [2024-10-25 00:38:26,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:38:26,150 INFO L218 hiAutomatonCegarLoop]: Abstraction has 57 states and 63 transitions. [2024-10-25 00:38:26,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 63 transitions. [2024-10-25 00:38:26,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-10-25 00:38:26,158 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-25 00:38:26,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2024-10-25 00:38:26,158 INFO L240 hiAutomatonCegarLoop]: Abstraction has 57 states and 63 transitions. [2024-10-25 00:38:26,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-25 00:38:26,160 INFO L425 stractBuchiCegarLoop]: Abstraction has 57 states and 63 transitions. [2024-10-25 00:38:26,160 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-25 00:38:26,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 63 transitions. [2024-10-25 00:38:26,162 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-10-25 00:38:26,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:38:26,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:38:26,168 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-25 00:38:26,171 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-25 00:38:26,171 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-25 00:38:26,172 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-25 00:38:26,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:38:26,173 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 10 times [2024-10-25 00:38:26,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:38:26,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854826050] [2024-10-25 00:38:26,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:38:26,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:38:26,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:26,185 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:38:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:26,192 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:38:26,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:38:26,195 INFO L85 PathProgramCache]: Analyzing trace with hash -531250216, now seen corresponding path program 7 times [2024-10-25 00:38:26,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:38:26,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976990429] [2024-10-25 00:38:26,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:38:26,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:38:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:30,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:36,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:37,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:37,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:37,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:37,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:37,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:37,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:37,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:37,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:37,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:37,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:37,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:37,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:37,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:38:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:39,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:39,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:39,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:39,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:39,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:39,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:39,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:39,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:39,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:39,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:39,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:38:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:39,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:39,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:39,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:39,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:39,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:39,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:39,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:39,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:39,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:39,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:40,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:40,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:40,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:38:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:40,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:40,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:40,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:40,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:40,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:40,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:40,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:40,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:40,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:40,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:40,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:40,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:40,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:38:40,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:40,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:40,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:40,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:40,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:40,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:40,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:40,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:40,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:40,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:40,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:40,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:40,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:40,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:38:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:40,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-25 00:38:40,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:38:41,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:38:41,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:38:41,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:38:41,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:38:41,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-25 00:38:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:38:41,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:38:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:41,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:41,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:38:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:38:42,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:38:42,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-25 00:38:42,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:38:42,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:38:42,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:38:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:38:42,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:38:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-25 00:38:42,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:42,784 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-25 00:38:42,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:38:42,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976990429] [2024-10-25 00:38:42,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976990429] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:38:42,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146010967] [2024-10-25 00:38:42,785 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-25 00:38:42,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:38:42,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:42,788 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 00:38:42,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-25 00:38:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:43,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 4960 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-10-25 00:38:43,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:38:44,027 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-25 00:38:44,475 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-25 00:38:44,476 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:38:50,092 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-25 00:38:50,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146010967] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:38:50,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:38:50,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 26] total 45 [2024-10-25 00:38:50,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601572092] [2024-10-25 00:38:50,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:38:50,095 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:38:50,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:38:50,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-10-25 00:38:50,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=1618, Unknown=0, NotChecked=0, Total=1980 [2024-10-25 00:38:50,097 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-25 00:38:50,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:38:50,519 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2024-10-25 00:38:50,519 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 65 transitions. [2024-10-25 00:38:50,520 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-10-25 00:38:50,521 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 59 states and 65 transitions. [2024-10-25 00:38:50,522 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2024-10-25 00:38:50,523 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2024-10-25 00:38:50,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 65 transitions. [2024-10-25 00:38:50,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:38:50,523 INFO L218 hiAutomatonCegarLoop]: Abstraction has 59 states and 65 transitions. [2024-10-25 00:38:50,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 65 transitions. [2024-10-25 00:38:50,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-25 00:38:50,528 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-25 00:38:50,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2024-10-25 00:38:50,531 INFO L240 hiAutomatonCegarLoop]: Abstraction has 59 states and 65 transitions. [2024-10-25 00:38:50,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-25 00:38:50,532 INFO L425 stractBuchiCegarLoop]: Abstraction has 59 states and 65 transitions. [2024-10-25 00:38:50,532 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-25 00:38:50,532 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 65 transitions. [2024-10-25 00:38:50,532 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-10-25 00:38:50,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:38:50,532 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:38:50,535 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-25 00:38:50,535 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-25 00:38:50,535 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-25 00:38:50,538 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-25 00:38:50,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:38:50,539 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 11 times [2024-10-25 00:38:50,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:38:50,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72865639] [2024-10-25 00:38:50,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:38:50,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:38:50,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:50,552 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:38:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:50,564 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:38:50,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:38:50,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1880621056, now seen corresponding path program 8 times [2024-10-25 00:38:50,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:38:50,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152335997] [2024-10-25 00:38:50,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:38:50,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:38:50,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:55,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:55,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:00,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:00,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:00,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:00,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:00,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:00,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:00,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:00,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:00,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:00,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:39:00,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:00,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:00,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:00,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:00,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:00,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:00,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:00,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:00,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:00,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:00,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:00,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:00,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:00,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:00,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:00,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:39:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:00,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:00,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:00,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:00,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:00,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:00,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:00,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:00,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:00,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:00,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:00,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:00,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:00,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:00,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:39:00,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:00,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:00,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:00,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:00,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:00,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:00,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:00,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:00,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:00,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:00,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:00,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:00,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:00,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:00,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:39:00,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:00,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:00,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:00,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:00,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:00,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:00,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:00,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:00,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:00,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:00,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:00,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:00,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:00,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:00,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:39:00,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:00,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:00,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:01,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:01,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:01,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:01,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:01,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:01,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:01,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:01,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:01,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:01,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:01,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:39:01,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:01,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-10-25 00:39:01,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:04,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:05,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:05,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:05,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:05,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:05,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:05,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:05,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:39:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:05,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:05,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:05,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:05,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:39:05,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:05,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:05,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:05,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:05,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:05,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:05,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:39:05,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:05,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:05,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:05,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:05,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:05,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:05,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:39:05,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:05,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:05,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:05,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:05,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:05,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:05,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:39:05,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:05,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:05,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:05,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:05,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:05,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:39:05,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:05,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-10-25 00:39:06,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:07,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:07,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:07,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:07,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:07,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:07,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:07,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:07,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:07,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:07,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:07,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:07,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:07,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:07,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:39:07,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:07,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:07,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:07,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:07,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:07,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:08,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:08,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:08,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:08,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:08,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:08,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:08,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:08,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:39:08,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:08,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:08,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:08,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:08,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:08,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:08,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:08,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:08,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:08,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:08,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:08,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:08,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:08,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:08,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:39:08,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:08,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:08,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:08,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:08,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:08,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:08,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:08,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:08,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:08,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:08,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:08,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:39:08,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:08,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:08,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:08,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:08,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:08,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:08,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:08,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:08,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:08,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:08,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:08,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:39:08,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:08,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:08,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:08,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:08,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:08,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:08,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:08,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:08,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:08,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:08,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:08,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:08,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:08,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:39:08,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:08,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-10-25 00:39:08,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:09,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:09,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:09,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:09,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:09,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:09,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:39:09,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:09,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:09,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:09,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:09,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:09,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:39:09,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:09,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:09,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:09,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:09,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:09,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:09,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:39:09,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:09,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:09,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:09,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:09,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:09,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:09,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:09,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:39:09,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:09,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:09,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:09,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:09,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:09,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:09,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:09,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:39:09,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:09,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:09,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:09,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:09,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:09,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:39:09,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:39:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-10-25 00:39:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:39:09,605 INFO L134 CoverageAnalysis]: Checked inductivity of 68806 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 68770 trivial. 0 not checked. [2024-10-25 00:39:09,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:39:09,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152335997] [2024-10-25 00:39:09,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152335997] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:39:09,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175873423] [2024-10-25 00:39:09,606 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-25 00:39:09,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:39:09,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:39:09,608 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 00:39:09,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-25 00:39:10,813 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-25 00:39:10,813 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 00:39:10,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 5864 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-10-25 00:39:10,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:39:10,858 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