./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-numeric/Ackermann01-1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 26d01a9c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-numeric/Ackermann01-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 64bit --witnessprinter.graph.data.programhash 380ed529f726f53285b49ce40e57404dbe066b029b8c3af7ce337366515780a5 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-18 08:55:42,733 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 08:55:42,735 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 08:55:42,765 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 08:55:42,766 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 08:55:42,768 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 08:55:42,771 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 08:55:42,773 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 08:55:42,775 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 08:55:42,780 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 08:55:42,781 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 08:55:42,784 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 08:55:42,784 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 08:55:42,789 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 08:55:42,791 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 08:55:42,792 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 08:55:42,793 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 08:55:42,794 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 08:55:42,795 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 08:55:42,802 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 08:55:42,803 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 08:55:42,804 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 08:55:42,805 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 08:55:42,806 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 08:55:42,813 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 08:55:42,814 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 08:55:42,814 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 08:55:42,816 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 08:55:42,816 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 08:55:42,817 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 08:55:42,817 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 08:55:42,818 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 08:55:42,819 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 08:55:42,820 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 08:55:42,821 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 08:55:42,821 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 08:55:42,822 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 08:55:42,822 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 08:55:42,822 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 08:55:42,823 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 08:55:42,824 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 08:55:42,825 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-02-18 08:55:42,858 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 08:55:42,859 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 08:55:42,859 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 08:55:42,859 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 08:55:42,861 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 08:55:42,861 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 08:55:42,861 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 08:55:42,861 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-02-18 08:55:42,861 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-02-18 08:55:42,861 INFO L138 SettingsManager]: * Use old map elimination=false [2023-02-18 08:55:42,862 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2023-02-18 08:55:42,863 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2023-02-18 08:55:42,863 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-02-18 08:55:42,863 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 08:55:42,863 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-18 08:55:42,863 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 08:55:42,863 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 08:55:42,864 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-02-18 08:55:42,864 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-02-18 08:55:42,864 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-02-18 08:55:42,864 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 08:55:42,864 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-02-18 08:55:42,865 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 08:55:42,865 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-02-18 08:55:42,865 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 08:55:42,865 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 08:55:42,866 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 08:55:42,866 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 08:55:42,866 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-02-18 08:55:42,867 INFO L138 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.graphml 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 380ed529f726f53285b49ce40e57404dbe066b029b8c3af7ce337366515780a5 [2023-02-18 08:55:43,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 08:55:43,131 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 08:55:43,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 08:55:43,134 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 08:55:43,134 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 08:55:43,135 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-numeric/Ackermann01-1.c [2023-02-18 08:55:44,327 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 08:55:44,495 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 08:55:44,496 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Ackermann01-1.c [2023-02-18 08:55:44,501 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48c36237b/52e4dfced4844383b628c971cc2ae2ac/FLAGb2d899af8 [2023-02-18 08:55:44,514 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48c36237b/52e4dfced4844383b628c971cc2ae2ac [2023-02-18 08:55:44,517 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 08:55:44,518 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 08:55:44,519 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 08:55:44,520 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 08:55:44,527 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 08:55:44,528 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 08:55:44" (1/1) ... [2023-02-18 08:55:44,529 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@358949aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:55:44, skipping insertion in model container [2023-02-18 08:55:44,529 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 08:55:44" (1/1) ... [2023-02-18 08:55:44,535 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 08:55:44,548 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 08:55:44,695 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Ackermann01-1.c[944,957] [2023-02-18 08:55:44,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 08:55:44,708 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 08:55:44,725 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Ackermann01-1.c[944,957] [2023-02-18 08:55:44,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 08:55:44,738 INFO L208 MainTranslator]: Completed translation [2023-02-18 08:55:44,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:55:44 WrapperNode [2023-02-18 08:55:44,739 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 08:55:44,741 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 08:55:44,742 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 08:55:44,742 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 08:55:44,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:55:44" (1/1) ... [2023-02-18 08:55:44,756 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:55:44" (1/1) ... [2023-02-18 08:55:44,770 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 29 [2023-02-18 08:55:44,771 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 08:55:44,771 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 08:55:44,771 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 08:55:44,771 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 08:55:44,778 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:55:44" (1/1) ... [2023-02-18 08:55:44,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:55:44" (1/1) ... [2023-02-18 08:55:44,787 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:55:44" (1/1) ... [2023-02-18 08:55:44,787 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:55:44" (1/1) ... [2023-02-18 08:55:44,794 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:55:44" (1/1) ... [2023-02-18 08:55:44,795 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:55:44" (1/1) ... [2023-02-18 08:55:44,797 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:55:44" (1/1) ... [2023-02-18 08:55:44,797 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:55:44" (1/1) ... [2023-02-18 08:55:44,804 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 08:55:44,805 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 08:55:44,805 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 08:55:44,806 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 08:55:44,806 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:55:44" (1/1) ... [2023-02-18 08:55:44,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:44,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:44,838 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) [2023-02-18 08:55:44,845 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 [2023-02-18 08:55:44,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 08:55:44,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 08:55:44,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 08:55:44,885 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2023-02-18 08:55:44,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2023-02-18 08:55:44,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 08:55:44,943 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 08:55:44,945 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 08:55:45,108 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 08:55:45,113 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 08:55:45,113 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-18 08:55:45,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 08:55:45 BoogieIcfgContainer [2023-02-18 08:55:45,115 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 08:55:45,116 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-02-18 08:55:45,120 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2023-02-18 08:55:45,124 INFO L275 PluginConnector]: BuchiAutomizer initialized [2023-02-18 08:55:45,125 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-18 08:55:45,125 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.02 08:55:44" (1/3) ... [2023-02-18 08:55:45,126 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@24d0a763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.02 08:55:45, skipping insertion in model container [2023-02-18 08:55:45,126 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-18 08:55:45,126 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:55:44" (2/3) ... [2023-02-18 08:55:45,126 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@24d0a763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.02 08:55:45, skipping insertion in model container [2023-02-18 08:55:45,126 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-18 08:55:45,127 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 08:55:45" (3/3) ... [2023-02-18 08:55:45,141 INFO L332 chiAutomizerObserver]: Analyzing ICFG Ackermann01-1.c [2023-02-18 08:55:45,216 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-02-18 08:55:45,216 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-02-18 08:55:45,216 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-02-18 08:55:45,216 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-02-18 08:55:45,216 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-02-18 08:55:45,217 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-02-18 08:55:45,217 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-02-18 08:55:45,217 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-02-18 08:55:45,221 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 08:55:45,238 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-02-18 08:55:45,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-18 08:55:45,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-18 08:55:45,246 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-18 08:55:45,246 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-18 08:55:45,246 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-02-18 08:55:45,246 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 08:55:45,248 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-02-18 08:55:45,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-18 08:55:45,249 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-18 08:55:45,249 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-18 08:55:45,249 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-18 08:55:45,256 INFO L748 eck$LassoCheckResult]: Stem: 18#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 5#L29true assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 6#L33true assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); 8#L36true call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1);< 9#$Ultimate##0true [2023-02-18 08:55:45,257 INFO L750 eck$LassoCheckResult]: Loop: 9#$Ultimate##0true ~m := #in~m;~n := #in~n; 12#L17true assume !(0 == ~m); 13#L20true assume 0 == ~n; 15#L21true call #t~ret4 := ackermann(~m - 1, 1);< 9#$Ultimate##0true [2023-02-18 08:55:45,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:55:45,265 INFO L85 PathProgramCache]: Analyzing trace with hash 28695872, now seen corresponding path program 1 times [2023-02-18 08:55:45,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:55:45,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474393622] [2023-02-18 08:55:45,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:55:45,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:55:45,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:55:45,367 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 08:55:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:55:45,409 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 08:55:45,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:55:45,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1697199, now seen corresponding path program 1 times [2023-02-18 08:55:45,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:55:45,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027926695] [2023-02-18 08:55:45,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:55:45,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:55:45,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:55:45,433 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 08:55:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:55:45,472 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 08:55:45,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:55:45,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1292962670, now seen corresponding path program 1 times [2023-02-18 08:55:45,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:55:45,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814263107] [2023-02-18 08:55:45,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:55:45,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:55:45,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:55:45,502 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 08:55:45,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:55:45,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 08:55:45,579 INFO L210 LassoAnalysis]: Preferences: [2023-02-18 08:55:45,580 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-18 08:55:45,580 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-18 08:55:45,580 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-18 08:55:45,580 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-18 08:55:45,581 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:45,581 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-18 08:55:45,581 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-18 08:55:45,581 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration1_Loop [2023-02-18 08:55:45,581 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-18 08:55:45,581 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-18 08:55:45,595 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:45,603 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:45,604 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:45,605 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:45,607 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:45,608 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:45,609 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:45,611 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:45,624 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-18 08:55:45,625 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-18 08:55:45,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:45,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:45,635 INFO L229 MonitoredProcess]: Starting monitored process 2 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) [2023-02-18 08:55:45,641 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:45,642 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:45,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-02-18 08:55:45,660 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:45,660 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~m=0} Honda state: {ackermann_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-18 08:55:45,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2023-02-18 08:55:45,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:45,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:45,672 INFO L229 MonitoredProcess]: Starting monitored process 3 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) [2023-02-18 08:55:45,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-02-18 08:55:45,678 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:45,679 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:45,697 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:45,697 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=0} Honda state: {ackermann_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-18 08:55:45,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:45,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:45,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:45,705 INFO L229 MonitoredProcess]: Starting monitored process 4 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) [2023-02-18 08:55:45,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-02-18 08:55:45,709 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:45,710 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:45,725 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:45,725 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret6=0} Honda state: {ackermann_#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-18 08:55:45,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-02-18 08:55:45,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:45,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:45,735 INFO L229 MonitoredProcess]: Starting monitored process 5 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) [2023-02-18 08:55:45,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-02-18 08:55:45,738 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:45,738 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:45,748 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:45,748 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret5=0} Honda state: {ackermann_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-18 08:55:45,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:45,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:45,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:45,761 INFO L229 MonitoredProcess]: Starting monitored process 6 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) [2023-02-18 08:55:45,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-02-18 08:55:45,764 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:45,764 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:45,777 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:45,777 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-18 08:55:45,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:45,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:45,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:45,782 INFO L229 MonitoredProcess]: Starting monitored process 7 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) [2023-02-18 08:55:45,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-02-18 08:55:45,786 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:45,786 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:45,799 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:45,799 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret4=0} Honda state: {ackermann_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-18 08:55:45,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:45,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:45,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:45,804 INFO L229 MonitoredProcess]: Starting monitored process 8 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) [2023-02-18 08:55:45,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-02-18 08:55:45,807 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:45,807 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:45,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2023-02-18 08:55:45,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:45,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:45,831 INFO L229 MonitoredProcess]: Starting monitored process 9 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) [2023-02-18 08:55:45,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-02-18 08:55:45,834 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-18 08:55:45,834 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:45,868 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-18 08:55:45,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:45,872 INFO L210 LassoAnalysis]: Preferences: [2023-02-18 08:55:45,873 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-18 08:55:45,873 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-18 08:55:45,873 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-18 08:55:45,873 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-18 08:55:45,873 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:45,873 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-18 08:55:45,873 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-18 08:55:45,873 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration1_Loop [2023-02-18 08:55:45,873 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-18 08:55:45,873 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-18 08:55:45,875 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:45,878 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:45,881 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:45,882 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:45,885 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:45,887 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:45,888 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:45,890 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:45,896 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-18 08:55:45,900 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-18 08:55:45,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:45,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:45,911 INFO L229 MonitoredProcess]: Starting monitored process 10 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) [2023-02-18 08:55:45,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-02-18 08:55:45,921 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:45,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:45,930 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:55:45,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:45,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:45,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:45,933 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:55:45,933 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:55:45,949 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:45,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:45,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:45,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:45,958 INFO L229 MonitoredProcess]: Starting monitored process 11 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) [2023-02-18 08:55:45,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-02-18 08:55:45,964 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:45,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:45,973 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:55:45,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:45,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:45,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:45,974 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:55:45,974 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:55:45,980 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:45,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:45,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:45,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:45,987 INFO L229 MonitoredProcess]: Starting monitored process 12 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) [2023-02-18 08:55:45,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-02-18 08:55:45,991 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:45,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:45,997 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:55:45,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:45,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:45,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:45,998 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:55:45,998 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:55:46,000 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:46,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:46,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:46,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:46,007 INFO L229 MonitoredProcess]: Starting monitored process 13 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) [2023-02-18 08:55:46,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-02-18 08:55:46,011 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:46,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:46,017 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:55:46,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:46,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:46,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:46,018 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:55:46,018 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:55:46,020 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:46,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:46,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:46,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:46,025 INFO L229 MonitoredProcess]: Starting monitored process 14 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) [2023-02-18 08:55:46,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-02-18 08:55:46,029 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:46,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:46,037 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:55:46,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:46,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:46,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:46,039 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:55:46,039 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:55:46,063 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-18 08:55:46,066 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-18 08:55:46,066 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-18 08:55:46,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:46,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:46,097 INFO L229 MonitoredProcess]: Starting monitored process 15 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) [2023-02-18 08:55:46,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-02-18 08:55:46,101 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-18 08:55:46,101 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-18 08:55:46,101 INFO L513 LassoAnalysis]: Proved termination. [2023-02-18 08:55:46,101 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ackermann_#in~n) = -2*ackermann_#in~n + 1 Supporting invariants [] [2023-02-18 08:55:46,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:46,109 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-18 08:55:46,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:55:46,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:46,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-18 08:55:46,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:55:46,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:46,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-18 08:55:46,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:55:46,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 08:55:46,249 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2023-02-18 08:55:46,252 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 08:55:46,394 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4). Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 50 states and 65 transitions. Complement of second has 12 states. [2023-02-18 08:55:46,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-02-18 08:55:46,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 08:55:46,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2023-02-18 08:55:46,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 4 letters. [2023-02-18 08:55:46,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:55:46,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2023-02-18 08:55:46,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:55:46,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 8 letters. [2023-02-18 08:55:46,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:55:46,413 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 65 transitions. [2023-02-18 08:55:46,417 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-02-18 08:55:46,438 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 29 states and 37 transitions. [2023-02-18 08:55:46,439 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2023-02-18 08:55:46,439 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2023-02-18 08:55:46,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2023-02-18 08:55:46,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-18 08:55:46,440 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2023-02-18 08:55:46,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2023-02-18 08:55:46,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2023-02-18 08:55:46,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-18 08:55:46,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2023-02-18 08:55:46,485 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 28 transitions. [2023-02-18 08:55:46,485 INFO L428 stractBuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2023-02-18 08:55:46,485 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-02-18 08:55:46,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2023-02-18 08:55:46,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-02-18 08:55:46,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-18 08:55:46,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-18 08:55:46,487 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 08:55:46,487 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-18 08:55:46,488 INFO L748 eck$LassoCheckResult]: Stem: 151#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 141#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 139#L29 assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 140#L33 assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); 136#L36 call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1);< 142#$Ultimate##0 ~m := #in~m;~n := #in~n; 143#L17 assume !(0 == ~m); 149#L20 assume !(0 == ~n); 135#L23 [2023-02-18 08:55:46,488 INFO L750 eck$LassoCheckResult]: Loop: 135#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 148#$Ultimate##0 ~m := #in~m;~n := #in~n; 152#L17 assume !(0 == ~m); 153#L20 assume !(0 == ~n); 135#L23 [2023-02-18 08:55:46,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:55:46,488 INFO L85 PathProgramCache]: Analyzing trace with hash 180255807, now seen corresponding path program 1 times [2023-02-18 08:55:46,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:55:46,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787456543] [2023-02-18 08:55:46,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:55:46,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:55:46,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:55:46,513 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 08:55:46,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:55:46,535 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 08:55:46,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:55:46,536 INFO L85 PathProgramCache]: Analyzing trace with hash 2259284, now seen corresponding path program 1 times [2023-02-18 08:55:46,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:55:46,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976230386] [2023-02-18 08:55:46,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:55:46,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:55:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:55:46,548 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 08:55:46,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:55:46,559 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 08:55:46,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:55:46,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1387046546, now seen corresponding path program 1 times [2023-02-18 08:55:46,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:55:46,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235180111] [2023-02-18 08:55:46,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:55:46,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:55:46,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:55:46,579 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 08:55:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:55:46,602 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 08:55:46,610 INFO L210 LassoAnalysis]: Preferences: [2023-02-18 08:55:46,611 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-18 08:55:46,611 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-18 08:55:46,611 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-18 08:55:46,611 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-18 08:55:46,611 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:46,611 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-18 08:55:46,612 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-18 08:55:46,612 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration2_Loop [2023-02-18 08:55:46,612 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-18 08:55:46,612 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-18 08:55:46,618 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:46,621 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:46,623 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:46,623 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:46,626 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:46,627 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:46,636 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-18 08:55:46,636 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-18 08:55:46,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:46,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:46,641 INFO L229 MonitoredProcess]: Starting monitored process 16 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) [2023-02-18 08:55:46,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-02-18 08:55:46,649 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:46,649 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:46,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:46,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:46,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:46,697 INFO L229 MonitoredProcess]: Starting monitored process 17 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) [2023-02-18 08:55:46,710 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-18 08:55:46,711 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:46,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-02-18 08:55:47,832 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:47,832 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=-8, ackermann_#in~n=-2} Honda state: {ackermann_~n=-8, ackermann_#in~n=-2} Generalized eigenvectors: [{ackermann_~n=0, ackermann_#in~n=-8}, {ackermann_~n=0, ackermann_#in~n=2}, {ackermann_~n=-1, ackermann_#in~n=-1}] Lambdas: [0, 0, 1] Nus: [0, 0] [2023-02-18 08:55:47,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:47,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:47,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:47,839 INFO L229 MonitoredProcess]: Starting monitored process 18 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) [2023-02-18 08:55:47,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-02-18 08:55:47,843 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:47,843 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:47,853 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:47,853 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret6=0} Honda state: {ackermann_#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-18 08:55:47,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:47,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:47,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:47,860 INFO L229 MonitoredProcess]: Starting monitored process 19 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) [2023-02-18 08:55:47,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-02-18 08:55:47,864 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:47,864 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:47,873 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:47,873 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret5=0} Honda state: {ackermann_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-18 08:55:47,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:47,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:47,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:47,878 INFO L229 MonitoredProcess]: Starting monitored process 20 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) [2023-02-18 08:55:47,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-02-18 08:55:47,882 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:47,885 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:47,909 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:47,909 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret4=0} Honda state: {ackermann_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-18 08:55:47,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:47,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:47,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:47,915 INFO L229 MonitoredProcess]: Starting monitored process 21 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) [2023-02-18 08:55:47,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-02-18 08:55:47,921 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:47,921 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:47,945 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:47,945 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~m=-8, ackermann_~m=-8} Honda state: {ackermann_#in~m=-8, ackermann_~m=-8} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-18 08:55:47,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:47,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:47,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:47,954 INFO L229 MonitoredProcess]: Starting monitored process 22 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) [2023-02-18 08:55:47,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-02-18 08:55:47,958 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:47,963 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:47,986 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:47,986 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-18 08:55:47,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:47,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:48,007 INFO L210 LassoAnalysis]: Preferences: [2023-02-18 08:55:48,007 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-18 08:55:48,007 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-18 08:55:48,007 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-18 08:55:48,007 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-18 08:55:48,007 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:48,008 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-18 08:55:48,008 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-18 08:55:48,008 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration2_Lasso [2023-02-18 08:55:48,008 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-18 08:55:48,008 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-18 08:55:48,010 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:48,011 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:48,023 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:48,024 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:48,025 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:48,034 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:48,049 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:48,050 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:48,051 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:48,052 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:48,053 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:48,054 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:48,055 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:48,055 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:48,056 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:48,057 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:48,058 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:48,059 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:48,061 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:48,062 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:48,072 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-18 08:55:48,072 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-18 08:55:48,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:48,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:48,074 INFO L229 MonitoredProcess]: Starting monitored process 23 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) [2023-02-18 08:55:48,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-02-18 08:55:48,089 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:48,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:48,097 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:55:48,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:48,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:48,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:48,098 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:55:48,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:55:48,101 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:48,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:48,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:48,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:48,108 INFO L229 MonitoredProcess]: Starting monitored process 24 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) [2023-02-18 08:55:48,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-02-18 08:55:48,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:48,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:48,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:48,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:48,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:48,122 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-18 08:55:48,123 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-18 08:55:48,134 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:48,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:48,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:48,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:48,143 INFO L229 MonitoredProcess]: Starting monitored process 25 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) [2023-02-18 08:55:48,153 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:48,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:48,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:48,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:48,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:48,164 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-18 08:55:48,165 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-18 08:55:48,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-02-18 08:55:48,181 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:48,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:48,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:48,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:48,190 INFO L229 MonitoredProcess]: Starting monitored process 26 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) [2023-02-18 08:55:48,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-02-18 08:55:48,194 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:48,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:48,202 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:55:48,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:48,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:48,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:48,203 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:55:48,203 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:55:48,221 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:48,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:48,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:48,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:48,227 INFO L229 MonitoredProcess]: Starting monitored process 27 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) [2023-02-18 08:55:48,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-02-18 08:55:48,231 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:48,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:48,239 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:55:48,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:48,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:48,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:48,240 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:55:48,241 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:55:48,247 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:48,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:48,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:48,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:48,252 INFO L229 MonitoredProcess]: Starting monitored process 28 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) [2023-02-18 08:55:48,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-02-18 08:55:48,256 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:48,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:48,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:48,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:48,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:48,266 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-18 08:55:48,266 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-18 08:55:48,293 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:48,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:48,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:48,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:48,301 INFO L229 MonitoredProcess]: Starting monitored process 29 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) [2023-02-18 08:55:48,306 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:48,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:48,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:48,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:48,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:48,316 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-18 08:55:48,316 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-18 08:55:48,330 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:48,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2023-02-18 08:55:48,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:48,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:48,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:48,339 INFO L229 MonitoredProcess]: Starting monitored process 30 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) [2023-02-18 08:55:48,345 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:48,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:48,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:48,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:48,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:48,355 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-18 08:55:48,355 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-18 08:55:48,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2023-02-18 08:55:48,373 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:48,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:48,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:48,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:48,381 INFO L229 MonitoredProcess]: Starting monitored process 31 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) [2023-02-18 08:55:48,385 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:48,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:48,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:48,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:48,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:48,396 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-18 08:55:48,396 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-18 08:55:48,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2023-02-18 08:55:48,417 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:48,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:48,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:48,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:48,425 INFO L229 MonitoredProcess]: Starting monitored process 32 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) [2023-02-18 08:55:48,429 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:48,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:48,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:48,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:48,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:48,439 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-18 08:55:48,439 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-18 08:55:48,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2023-02-18 08:55:48,457 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:48,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:48,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:48,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:48,465 INFO L229 MonitoredProcess]: Starting monitored process 33 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) [2023-02-18 08:55:48,473 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:48,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:48,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:48,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:48,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:48,483 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-18 08:55:48,483 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-18 08:55:48,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2023-02-18 08:55:48,495 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:48,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2023-02-18 08:55:48,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:48,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:48,500 INFO L229 MonitoredProcess]: Starting monitored process 34 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) [2023-02-18 08:55:48,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2023-02-18 08:55:48,503 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:48,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:48,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:48,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:48,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:48,512 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-18 08:55:48,512 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-18 08:55:48,537 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:48,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:48,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:48,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:48,543 INFO L229 MonitoredProcess]: Starting monitored process 35 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) [2023-02-18 08:55:48,549 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:48,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2023-02-18 08:55:48,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:48,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:48,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:48,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:48,559 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-18 08:55:48,559 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-18 08:55:48,577 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:48,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:48,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:48,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:48,587 INFO L229 MonitoredProcess]: Starting monitored process 36 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) [2023-02-18 08:55:48,593 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:48,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:48,601 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:55:48,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:48,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:48,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:48,602 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:55:48,603 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:55:48,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2023-02-18 08:55:48,613 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:48,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:48,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:48,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:48,622 INFO L229 MonitoredProcess]: Starting monitored process 37 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) [2023-02-18 08:55:48,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2023-02-18 08:55:48,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:48,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:48,634 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:55:48,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:48,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:48,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:48,635 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:55:48,635 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:55:48,649 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:48,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:48,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:48,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:48,656 INFO L229 MonitoredProcess]: Starting monitored process 38 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) [2023-02-18 08:55:48,662 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:48,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:48,670 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:55:48,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:48,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:48,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:48,671 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:55:48,671 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:55:48,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2023-02-18 08:55:48,685 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:48,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:48,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:48,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:48,697 INFO L229 MonitoredProcess]: Starting monitored process 39 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) [2023-02-18 08:55:48,705 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:48,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:48,713 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:55:48,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:48,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:48,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:48,714 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:55:48,714 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:55:48,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2023-02-18 08:55:48,729 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:48,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:48,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:48,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:48,737 INFO L229 MonitoredProcess]: Starting monitored process 40 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) [2023-02-18 08:55:48,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2023-02-18 08:55:48,740 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:48,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:48,748 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:55:48,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:48,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:48,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:48,749 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:55:48,749 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:55:48,777 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:48,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:48,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:48,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:48,783 INFO L229 MonitoredProcess]: Starting monitored process 41 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) [2023-02-18 08:55:48,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2023-02-18 08:55:48,787 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:48,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:48,795 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:55:48,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:48,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:48,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:48,796 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:55:48,797 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:55:48,813 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:48,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:48,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:48,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:48,820 INFO L229 MonitoredProcess]: Starting monitored process 42 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) [2023-02-18 08:55:48,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2023-02-18 08:55:48,826 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:48,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:48,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:55:48,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:48,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:48,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:48,834 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:55:48,834 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:55:48,849 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:48,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:48,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:48,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:48,855 INFO L229 MonitoredProcess]: Starting monitored process 43 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) [2023-02-18 08:55:48,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2023-02-18 08:55:48,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:48,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:48,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:55:48,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:48,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:48,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:48,867 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:55:48,867 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:55:48,868 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:48,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:48,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:48,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:48,872 INFO L229 MonitoredProcess]: Starting monitored process 44 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) [2023-02-18 08:55:48,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2023-02-18 08:55:48,876 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:48,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:48,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:48,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:48,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:48,884 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-18 08:55:48,884 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-18 08:55:48,899 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:48,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:48,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:48,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:48,905 INFO L229 MonitoredProcess]: Starting monitored process 45 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) [2023-02-18 08:55:48,909 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:48,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:48,917 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:55:48,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:48,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:48,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:48,917 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:55:48,917 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:55:48,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2023-02-18 08:55:48,937 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:48,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2023-02-18 08:55:48,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:48,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:48,941 INFO L229 MonitoredProcess]: Starting monitored process 46 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) [2023-02-18 08:55:48,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2023-02-18 08:55:48,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:48,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:48,953 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2023-02-18 08:55:48,953 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-02-18 08:55:48,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:48,962 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2023-02-18 08:55:48,963 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-02-18 08:55:48,984 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-18 08:55:49,000 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-02-18 08:55:49,000 INFO L444 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero. [2023-02-18 08:55:49,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:49,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:49,005 INFO L229 MonitoredProcess]: Starting monitored process 47 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) [2023-02-18 08:55:49,017 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-18 08:55:49,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2023-02-18 08:55:49,040 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2023-02-18 08:55:49,040 INFO L513 LassoAnalysis]: Proved termination. [2023-02-18 08:55:49,040 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ackermann_~n) = 1*ackermann_~n Supporting invariants [2*ackermann_~n - 1 >= 0] [2023-02-18 08:55:49,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:49,049 INFO L156 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2023-02-18 08:55:49,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:55:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:49,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 08:55:49,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:55:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:49,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 08:55:49,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:55:49,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 08:55:49,149 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2023-02-18 08:55:49,149 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 8 Second operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 08:55:49,203 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 8. Second operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 34 states and 45 transitions. Complement of second has 12 states. [2023-02-18 08:55:49,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 1 non-accepting loop states 2 accepting loop states [2023-02-18 08:55:49,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 08:55:49,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 12 transitions. [2023-02-18 08:55:49,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 12 transitions. Stem has 8 letters. Loop has 4 letters. [2023-02-18 08:55:49,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:55:49,204 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-18 08:55:49,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:55:49,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:49,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 08:55:49,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:55:49,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:49,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:49,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 08:55:49,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:55:49,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 08:55:49,315 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 3 loop predicates [2023-02-18 08:55:49,315 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 8 Second operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 08:55:49,409 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 8. Second operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 48 states and 67 transitions. Complement of second has 20 states. [2023-02-18 08:55:49,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 3 non-accepting loop states 1 accepting loop states [2023-02-18 08:55:49,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 08:55:49,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 18 transitions. [2023-02-18 08:55:49,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 8 letters. Loop has 4 letters. [2023-02-18 08:55:49,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:55:49,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 12 letters. Loop has 4 letters. [2023-02-18 08:55:49,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:55:49,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 8 letters. Loop has 8 letters. [2023-02-18 08:55:49,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:55:49,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 67 transitions. [2023-02-18 08:55:49,425 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-02-18 08:55:49,429 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 42 states and 59 transitions. [2023-02-18 08:55:49,429 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2023-02-18 08:55:49,430 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2023-02-18 08:55:49,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 59 transitions. [2023-02-18 08:55:49,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-18 08:55:49,430 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 59 transitions. [2023-02-18 08:55:49,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 59 transitions. [2023-02-18 08:55:49,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2023-02-18 08:55:49,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 8 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) [2023-02-18 08:55:49,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2023-02-18 08:55:49,438 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 45 transitions. [2023-02-18 08:55:49,438 INFO L428 stractBuchiCegarLoop]: Abstraction has 33 states and 45 transitions. [2023-02-18 08:55:49,438 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-02-18 08:55:49,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 45 transitions. [2023-02-18 08:55:49,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2023-02-18 08:55:49,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-18 08:55:49,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-18 08:55:49,440 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 08:55:49,440 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-18 08:55:49,440 INFO L748 eck$LassoCheckResult]: Stem: 418#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 405#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 402#L29 assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 403#L33 assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); 393#L36 call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1);< 404#$Ultimate##0 ~m := #in~m;~n := #in~n; 407#L17 assume !(0 == ~m); 411#L20 assume !(0 == ~n); 397#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 417#$Ultimate##0 ~m := #in~m;~n := #in~n; 424#L17 assume !(0 == ~m); 413#L20 assume 0 == ~n; 399#L21 [2023-02-18 08:55:49,440 INFO L750 eck$LassoCheckResult]: Loop: 399#L21 call #t~ret4 := ackermann(~m - 1, 1);< 410#$Ultimate##0 ~m := #in~m;~n := #in~n; 422#L17 assume !(0 == ~m); 423#L20 assume 0 == ~n; 399#L21 [2023-02-18 08:55:49,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:55:49,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1387046543, now seen corresponding path program 1 times [2023-02-18 08:55:49,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:55:49,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013433953] [2023-02-18 08:55:49,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:55:49,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:55:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:55:49,450 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 08:55:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:55:49,459 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 08:55:49,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:55:49,460 INFO L85 PathProgramCache]: Analyzing trace with hash 2199699, now seen corresponding path program 2 times [2023-02-18 08:55:49,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:55:49,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268691349] [2023-02-18 08:55:49,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:55:49,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:55:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:49,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 08:55:49,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:55:49,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268691349] [2023-02-18 08:55:49,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268691349] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 08:55:49,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 08:55:49,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 08:55:49,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842306659] [2023-02-18 08:55:49,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 08:55:49,499 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-18 08:55:49,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 08:55:49,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 08:55:49,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 08:55:49,503 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. cyclomatic complexity: 15 Second operand has 4 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 08:55:49,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 08:55:49,540 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2023-02-18 08:55:49,540 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 63 transitions. [2023-02-18 08:55:49,542 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2023-02-18 08:55:49,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 45 states and 61 transitions. [2023-02-18 08:55:49,543 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2023-02-18 08:55:49,544 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2023-02-18 08:55:49,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 61 transitions. [2023-02-18 08:55:49,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-18 08:55:49,544 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 61 transitions. [2023-02-18 08:55:49,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 61 transitions. [2023-02-18 08:55:49,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2023-02-18 08:55:49,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 31 states have internal predecessors, (35), 11 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (11), 6 states have call predecessors, (11), 8 states have call successors, (11) [2023-02-18 08:55:49,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2023-02-18 08:55:49,549 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 60 transitions. [2023-02-18 08:55:49,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 08:55:49,550 INFO L428 stractBuchiCegarLoop]: Abstraction has 44 states and 60 transitions. [2023-02-18 08:55:49,550 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-02-18 08:55:49,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 60 transitions. [2023-02-18 08:55:49,551 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2023-02-18 08:55:49,551 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-18 08:55:49,551 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-18 08:55:49,552 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 08:55:49,552 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2023-02-18 08:55:49,552 INFO L748 eck$LassoCheckResult]: Stem: 508#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 489#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 486#L29 assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 487#L33 assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); 488#L36 call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1);< 490#$Ultimate##0 ~m := #in~m;~n := #in~n; 515#L17 assume !(0 == ~m); 524#L20 assume !(0 == ~n); 483#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 507#$Ultimate##0 ~m := #in~m;~n := #in~n; 523#L17 assume !(0 == ~m); 520#L20 assume 0 == ~n; 510#L21 [2023-02-18 08:55:49,553 INFO L750 eck$LassoCheckResult]: Loop: 510#L21 call #t~ret4 := ackermann(~m - 1, 1);< 511#$Ultimate##0 ~m := #in~m;~n := #in~n; 517#L17 assume !(0 == ~m); 518#L20 assume !(0 == ~n); 502#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 500#$Ultimate##0 ~m := #in~m;~n := #in~n; 521#L17 assume !(0 == ~m); 522#L20 assume 0 == ~n; 510#L21 [2023-02-18 08:55:49,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:55:49,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1387046543, now seen corresponding path program 2 times [2023-02-18 08:55:49,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:55:49,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960318596] [2023-02-18 08:55:49,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:55:49,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:55:49,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:55:49,562 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 08:55:49,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:55:49,570 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 08:55:49,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:55:49,570 INFO L85 PathProgramCache]: Analyzing trace with hash -47204506, now seen corresponding path program 1 times [2023-02-18 08:55:49,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:55:49,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193000164] [2023-02-18 08:55:49,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:55:49,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:55:49,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:55:49,576 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 08:55:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:55:49,580 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 08:55:49,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:55:49,581 INFO L85 PathProgramCache]: Analyzing trace with hash -2117341196, now seen corresponding path program 1 times [2023-02-18 08:55:49,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:55:49,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060038473] [2023-02-18 08:55:49,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:55:49,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:55:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:55:49,596 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 08:55:49,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:55:49,607 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 08:55:49,617 INFO L210 LassoAnalysis]: Preferences: [2023-02-18 08:55:49,617 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-18 08:55:49,617 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-18 08:55:49,617 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-18 08:55:49,617 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-18 08:55:49,617 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:49,617 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-18 08:55:49,617 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-18 08:55:49,617 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration4_Loop [2023-02-18 08:55:49,617 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-18 08:55:49,617 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-18 08:55:49,619 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:49,621 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:49,622 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:49,622 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:49,623 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:49,624 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:49,635 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-18 08:55:49,635 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-18 08:55:49,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:49,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:49,637 INFO L229 MonitoredProcess]: Starting monitored process 48 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) [2023-02-18 08:55:49,646 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:49,646 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:49,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2023-02-18 08:55:49,670 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:49,670 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=0, ackermann_#in~n=0} Honda state: {ackermann_~n=0, ackermann_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-18 08:55:49,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2023-02-18 08:55:49,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:49,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:49,674 INFO L229 MonitoredProcess]: Starting monitored process 49 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) [2023-02-18 08:55:49,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2023-02-18 08:55:49,677 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:49,677 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:49,685 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:49,685 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret4=0} Honda state: {ackermann_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-18 08:55:49,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:49,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:49,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:49,694 INFO L229 MonitoredProcess]: Starting monitored process 50 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) [2023-02-18 08:55:49,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2023-02-18 08:55:49,698 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:49,699 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:49,707 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:49,707 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-18 08:55:49,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:49,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:49,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:49,712 INFO L229 MonitoredProcess]: Starting monitored process 51 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) [2023-02-18 08:55:49,716 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:49,716 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:49,737 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:49,737 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret5=0} Honda state: {ackermann_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-18 08:55:49,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2023-02-18 08:55:49,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:49,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:49,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:49,742 INFO L229 MonitoredProcess]: Starting monitored process 52 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) [2023-02-18 08:55:49,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2023-02-18 08:55:49,749 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:49,749 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:49,755 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:49,756 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret6=0} Honda state: {ackermann_#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-18 08:55:49,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:49,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:49,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:49,760 INFO L229 MonitoredProcess]: Starting monitored process 53 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) [2023-02-18 08:55:49,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2023-02-18 08:55:49,764 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:49,764 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:49,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2023-02-18 08:55:49,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:49,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:49,783 INFO L229 MonitoredProcess]: Starting monitored process 54 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) [2023-02-18 08:55:49,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2023-02-18 08:55:49,786 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-18 08:55:49,786 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:50,083 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:50,083 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~m=0, ackermann_~m=0} Honda state: {ackermann_#in~m=0, ackermann_~m=0} Generalized eigenvectors: [{ackermann_#in~m=-1, ackermann_~m=-1}, {ackermann_#in~m=5, ackermann_~m=0}, {ackermann_#in~m=-5, ackermann_~m=0}] Lambdas: [1, 0, 0] Nus: [0, 0] [2023-02-18 08:55:50,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2023-02-18 08:55:50,101 INFO L210 LassoAnalysis]: Preferences: [2023-02-18 08:55:50,101 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-18 08:55:50,101 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-18 08:55:50,101 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-18 08:55:50,101 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-18 08:55:50,101 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:50,101 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-18 08:55:50,102 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-18 08:55:50,102 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration4_Lasso [2023-02-18 08:55:50,102 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-18 08:55:50,102 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-18 08:55:50,104 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:50,117 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:50,118 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:50,119 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:50,120 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:50,128 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:50,129 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:50,130 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:50,131 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:50,131 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:50,132 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:50,137 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:50,138 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:50,139 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:50,140 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:50,141 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:50,145 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:50,148 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:50,149 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:50,153 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:50,173 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-18 08:55:50,173 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-18 08:55:50,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:50,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:50,174 INFO L229 MonitoredProcess]: Starting monitored process 55 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) [2023-02-18 08:55:50,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2023-02-18 08:55:50,178 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:50,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:50,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:50,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:50,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:50,188 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-18 08:55:50,188 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-18 08:55:50,202 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:50,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:50,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:50,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:50,208 INFO L229 MonitoredProcess]: Starting monitored process 56 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) [2023-02-18 08:55:50,217 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:50,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:50,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:50,225 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:50,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:50,227 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-18 08:55:50,227 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-18 08:55:50,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2023-02-18 08:55:50,241 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:50,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:50,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:50,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:50,246 INFO L229 MonitoredProcess]: Starting monitored process 57 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) [2023-02-18 08:55:50,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2023-02-18 08:55:50,250 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:50,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:50,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:50,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:50,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:50,257 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-18 08:55:50,257 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-18 08:55:50,273 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:50,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:50,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:50,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:50,277 INFO L229 MonitoredProcess]: Starting monitored process 58 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) [2023-02-18 08:55:50,285 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:50,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2023-02-18 08:55:50,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:50,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:50,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:50,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:50,295 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-18 08:55:50,295 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-18 08:55:50,309 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:50,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:50,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:50,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:50,314 INFO L229 MonitoredProcess]: Starting monitored process 59 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) [2023-02-18 08:55:50,321 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:50,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:50,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:50,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:50,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:50,334 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-18 08:55:50,334 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-18 08:55:50,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2023-02-18 08:55:50,344 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:50,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:50,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:50,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:50,350 INFO L229 MonitoredProcess]: Starting monitored process 60 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) [2023-02-18 08:55:50,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2023-02-18 08:55:50,354 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:50,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:50,362 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:55:50,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:50,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:50,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:50,363 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:55:50,363 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:55:50,389 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:50,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:50,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:50,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:50,394 INFO L229 MonitoredProcess]: Starting monitored process 61 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) [2023-02-18 08:55:50,401 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:50,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:50,409 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:55:50,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:50,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:50,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:50,409 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:55:50,410 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:55:50,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2023-02-18 08:55:50,422 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:50,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:50,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:50,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:50,427 INFO L229 MonitoredProcess]: Starting monitored process 62 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) [2023-02-18 08:55:50,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2023-02-18 08:55:50,430 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:50,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:50,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:50,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:50,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:50,438 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-18 08:55:50,438 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-18 08:55:50,457 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:50,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:50,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:50,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:50,463 INFO L229 MonitoredProcess]: Starting monitored process 63 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) [2023-02-18 08:55:50,473 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:50,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:50,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:50,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:50,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:50,482 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-18 08:55:50,482 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-18 08:55:50,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2023-02-18 08:55:50,493 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:50,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:50,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:50,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:50,499 INFO L229 MonitoredProcess]: Starting monitored process 64 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) [2023-02-18 08:55:50,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2023-02-18 08:55:50,503 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:50,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:50,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:50,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:50,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:50,512 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-18 08:55:50,512 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-18 08:55:50,537 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:50,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:50,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:50,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:50,542 INFO L229 MonitoredProcess]: Starting monitored process 65 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) [2023-02-18 08:55:50,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2023-02-18 08:55:50,546 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:50,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:50,554 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:55:50,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:50,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:50,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:50,555 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:55:50,555 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:55:50,566 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:50,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2023-02-18 08:55:50,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:50,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:50,570 INFO L229 MonitoredProcess]: Starting monitored process 66 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) [2023-02-18 08:55:50,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2023-02-18 08:55:50,575 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:50,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:50,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:50,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:50,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:50,583 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-18 08:55:50,583 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-18 08:55:50,608 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:50,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:50,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:50,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:50,613 INFO L229 MonitoredProcess]: Starting monitored process 67 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) [2023-02-18 08:55:50,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2023-02-18 08:55:50,616 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:50,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:50,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:50,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:50,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:50,624 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-18 08:55:50,624 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-18 08:55:50,645 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:50,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:50,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:50,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:50,650 INFO L229 MonitoredProcess]: Starting monitored process 68 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) [2023-02-18 08:55:50,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2023-02-18 08:55:50,653 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:50,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:50,659 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:55:50,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:50,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:50,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:50,660 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:55:50,660 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:55:50,661 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:50,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2023-02-18 08:55:50,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:50,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:50,665 INFO L229 MonitoredProcess]: Starting monitored process 69 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) [2023-02-18 08:55:50,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2023-02-18 08:55:50,668 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:50,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:50,675 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:55:50,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:50,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:50,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:50,681 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:55:50,681 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:55:50,694 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:50,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:50,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:50,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:50,698 INFO L229 MonitoredProcess]: Starting monitored process 70 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) [2023-02-18 08:55:50,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2023-02-18 08:55:50,702 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:50,707 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:50,708 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:55:50,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:50,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:50,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:50,708 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:55:50,708 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:55:50,709 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:50,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2023-02-18 08:55:50,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:50,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:50,713 INFO L229 MonitoredProcess]: Starting monitored process 71 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) [2023-02-18 08:55:50,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2023-02-18 08:55:50,716 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:50,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:50,722 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:55:50,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:50,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:50,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:50,723 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:55:50,723 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:55:50,724 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:50,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:50,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:50,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:50,728 INFO L229 MonitoredProcess]: Starting monitored process 72 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) [2023-02-18 08:55:50,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2023-02-18 08:55:50,731 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:50,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:50,737 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:55:50,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:50,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:50,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:50,737 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:55:50,738 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:55:50,773 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:50,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:50,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:50,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:50,778 INFO L229 MonitoredProcess]: Starting monitored process 73 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) [2023-02-18 08:55:50,785 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:50,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2023-02-18 08:55:50,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:50,792 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:55:50,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:50,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:50,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:50,792 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:55:50,792 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:55:50,793 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:50,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:50,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:50,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:50,797 INFO L229 MonitoredProcess]: Starting monitored process 74 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) [2023-02-18 08:55:50,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2023-02-18 08:55:50,801 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:50,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:50,807 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:55:50,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:50,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:50,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:50,807 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:55:50,807 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:55:50,808 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:50,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:50,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:50,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:50,813 INFO L229 MonitoredProcess]: Starting monitored process 75 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) [2023-02-18 08:55:50,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2023-02-18 08:55:50,821 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:50,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:50,828 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2023-02-18 08:55:50,828 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2023-02-18 08:55:50,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:50,861 INFO L401 nArgumentSynthesizer]: We have 72 Motzkin's Theorem applications. [2023-02-18 08:55:50,861 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2023-02-18 08:55:50,942 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-18 08:55:50,993 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2023-02-18 08:55:50,993 INFO L444 ModelExtractionUtils]: 16 out of 28 variables were initially zero. Simplification set additionally 8 variables to zero. [2023-02-18 08:55:50,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:50,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:50,997 INFO L229 MonitoredProcess]: Starting monitored process 76 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) [2023-02-18 08:55:51,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2023-02-18 08:55:51,001 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-18 08:55:51,023 INFO L438 nArgumentSynthesizer]: Removed 7 redundant supporting invariants from a total of 8. [2023-02-18 08:55:51,023 INFO L513 LassoAnalysis]: Proved termination. [2023-02-18 08:55:51,023 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ackermann_~m) = 1*ackermann_~m Supporting invariants [1*ackermann_~m - 1 >= 0] [2023-02-18 08:55:51,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:51,035 INFO L156 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2023-02-18 08:55:51,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:55:51,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:51,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-18 08:55:51,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:55:51,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:51,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-18 08:55:51,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:55:51,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-18 08:55:51,183 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 4 loop predicates [2023-02-18 08:55:51,184 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 60 transitions. cyclomatic complexity: 18 Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 08:55:51,276 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 60 transitions. cyclomatic complexity: 18. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 75 states and 106 transitions. Complement of second has 14 states. [2023-02-18 08:55:51,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 1 non-accepting loop states 2 accepting loop states [2023-02-18 08:55:51,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 08:55:51,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2023-02-18 08:55:51,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 12 letters. Loop has 8 letters. [2023-02-18 08:55:51,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:55:51,280 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-18 08:55:51,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:55:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:51,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-18 08:55:51,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:55:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:51,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-18 08:55:51,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:55:51,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-18 08:55:51,412 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 4 loop predicates [2023-02-18 08:55:51,412 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 60 transitions. cyclomatic complexity: 18 Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 08:55:51,602 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 60 transitions. cyclomatic complexity: 18. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 151 states and 223 transitions. Complement of second has 31 states. [2023-02-18 08:55:51,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 5 stem states 5 non-accepting loop states 1 accepting loop states [2023-02-18 08:55:51,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 08:55:51,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 34 transitions. [2023-02-18 08:55:51,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 34 transitions. Stem has 12 letters. Loop has 8 letters. [2023-02-18 08:55:51,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:55:51,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 34 transitions. Stem has 20 letters. Loop has 8 letters. [2023-02-18 08:55:51,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:55:51,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 34 transitions. Stem has 12 letters. Loop has 16 letters. [2023-02-18 08:55:51,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:55:51,605 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 223 transitions. [2023-02-18 08:55:51,609 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2023-02-18 08:55:51,612 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 115 states and 180 transitions. [2023-02-18 08:55:51,613 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2023-02-18 08:55:51,613 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2023-02-18 08:55:51,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 180 transitions. [2023-02-18 08:55:51,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-18 08:55:51,613 INFO L218 hiAutomatonCegarLoop]: Abstraction has 115 states and 180 transitions. [2023-02-18 08:55:51,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 180 transitions. [2023-02-18 08:55:51,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 110. [2023-02-18 08:55:51,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 72 states have (on average 1.1805555555555556) internal successors, (85), 76 states have internal predecessors, (85), 25 states have call successors, (36), 15 states have call predecessors, (36), 13 states have return successors, (54), 18 states have call predecessors, (54), 20 states have call successors, (54) [2023-02-18 08:55:51,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 175 transitions. [2023-02-18 08:55:51,624 INFO L240 hiAutomatonCegarLoop]: Abstraction has 110 states and 175 transitions. [2023-02-18 08:55:51,624 INFO L428 stractBuchiCegarLoop]: Abstraction has 110 states and 175 transitions. [2023-02-18 08:55:51,624 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-02-18 08:55:51,624 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 175 transitions. [2023-02-18 08:55:51,631 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2023-02-18 08:55:51,631 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-18 08:55:51,631 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-18 08:55:51,632 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 08:55:51,632 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-18 08:55:51,632 INFO L748 eck$LassoCheckResult]: Stem: 1028#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 988#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 985#L29 assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 986#L33 assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); 987#L36 call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1);< 989#$Ultimate##0 ~m := #in~m;~n := #in~n; 1047#L17 assume !(0 == ~m); 1044#L20 assume !(0 == ~n); 1022#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 1030#$Ultimate##0 ~m := #in~m;~n := #in~n; 1071#L17 assume 0 == ~m;#res := 1 + ~n; 1070#ackermannFINAL assume true; 1061#ackermannEXIT >#45#return; 1008#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 1009#$Ultimate##0 [2023-02-18 08:55:51,633 INFO L750 eck$LassoCheckResult]: Loop: 1009#$Ultimate##0 ~m := #in~m;~n := #in~n; 1068#L17 assume !(0 == ~m); 1065#L20 assume !(0 == ~n); 1024#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 1009#$Ultimate##0 [2023-02-18 08:55:51,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:55:51,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1511844440, now seen corresponding path program 1 times [2023-02-18 08:55:51,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:55:51,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81801516] [2023-02-18 08:55:51,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:55:51,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:55:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:51,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:51,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-18 08:55:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:51,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 08:55:51,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:55:51,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81801516] [2023-02-18 08:55:51,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81801516] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 08:55:51,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684703319] [2023-02-18 08:55:51,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:55:51,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 08:55:51,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:51,777 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 08:55:51,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2023-02-18 08:55:51,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:51,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-18 08:55:51,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:55:51,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 08:55:51,830 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 08:55:51,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684703319] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 08:55:51,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 08:55:51,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2023-02-18 08:55:51,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039907636] [2023-02-18 08:55:51,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 08:55:51,831 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-18 08:55:51,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:55:51,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1697294, now seen corresponding path program 2 times [2023-02-18 08:55:51,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:55:51,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116950563] [2023-02-18 08:55:51,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:55:51,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:55:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:55:51,835 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 08:55:51,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:55:51,837 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 08:55:51,841 INFO L210 LassoAnalysis]: Preferences: [2023-02-18 08:55:51,841 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-18 08:55:51,841 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-18 08:55:51,841 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-18 08:55:51,841 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-18 08:55:51,841 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:51,841 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-18 08:55:51,841 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-18 08:55:51,841 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration5_Loop [2023-02-18 08:55:51,842 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-18 08:55:51,842 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-18 08:55:51,842 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:51,845 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:51,846 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:51,846 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:51,847 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:51,848 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:51,848 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:51,849 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:51,852 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-18 08:55:51,852 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-18 08:55:51,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:51,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:51,853 INFO L229 MonitoredProcess]: Starting monitored process 78 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) [2023-02-18 08:55:51,862 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:51,862 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:51,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2023-02-18 08:55:51,889 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:51,889 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=0} Honda state: {ackermann_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-18 08:55:51,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:51,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:51,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:51,894 INFO L229 MonitoredProcess]: Starting monitored process 79 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) [2023-02-18 08:55:51,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2023-02-18 08:55:51,897 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:51,897 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:51,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:51,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:51,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:51,909 INFO L229 MonitoredProcess]: Starting monitored process 80 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) [2023-02-18 08:55:51,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2023-02-18 08:55:51,912 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-18 08:55:51,912 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:51,931 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:51,932 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~n=-8} Honda state: {ackermann_#in~n=-8} Generalized eigenvectors: [{ackermann_#in~n=0}, {ackermann_#in~n=0}, {ackermann_#in~n=-1}] Lambdas: [2, 8, 1] Nus: [0, 0] [2023-02-18 08:55:51,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2023-02-18 08:55:51,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:51,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:51,937 INFO L229 MonitoredProcess]: Starting monitored process 81 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) [2023-02-18 08:55:51,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2023-02-18 08:55:51,940 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:51,940 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:51,948 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:51,948 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~m=0} Honda state: {ackermann_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-18 08:55:51,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:51,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:51,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:51,953 INFO L229 MonitoredProcess]: Starting monitored process 82 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) [2023-02-18 08:55:51,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2023-02-18 08:55:51,956 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:51,956 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:51,964 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:51,964 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret5=0} Honda state: {ackermann_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-18 08:55:51,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2023-02-18 08:55:51,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:51,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:51,968 INFO L229 MonitoredProcess]: Starting monitored process 83 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) [2023-02-18 08:55:51,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2023-02-18 08:55:51,971 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:51,971 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:51,979 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:51,979 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret4=0} Honda state: {ackermann_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-18 08:55:51,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:51,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:51,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:51,984 INFO L229 MonitoredProcess]: Starting monitored process 84 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) [2023-02-18 08:55:51,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2023-02-18 08:55:51,987 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:51,987 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:51,994 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:51,994 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-18 08:55:51,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:51,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:51,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:51,998 INFO L229 MonitoredProcess]: Starting monitored process 85 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) [2023-02-18 08:55:52,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2023-02-18 08:55:52,001 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:52,002 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:52,014 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:52,014 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~m=4} Honda state: {ackermann_#in~m=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-18 08:55:52,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2023-02-18 08:55:52,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:52,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:52,018 INFO L229 MonitoredProcess]: Starting monitored process 86 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) [2023-02-18 08:55:52,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2023-02-18 08:55:52,022 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:52,022 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:52,029 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:52,029 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret6=0} Honda state: {ackermann_#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-18 08:55:52,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:52,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 08:55:52,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 08:55:52,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-02-18 08:55:52,037 INFO L87 Difference]: Start difference. First operand 110 states and 175 transitions. cyclomatic complexity: 71 Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 08:55:52,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 08:55:52,083 INFO L93 Difference]: Finished difference Result 82 states and 111 transitions. [2023-02-18 08:55:52,083 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 111 transitions. [2023-02-18 08:55:52,085 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2023-02-18 08:55:52,086 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 76 states and 105 transitions. [2023-02-18 08:55:52,086 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2023-02-18 08:55:52,087 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2023-02-18 08:55:52,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 105 transitions. [2023-02-18 08:55:52,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-18 08:55:52,087 INFO L218 hiAutomatonCegarLoop]: Abstraction has 76 states and 105 transitions. [2023-02-18 08:55:52,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 105 transitions. [2023-02-18 08:55:52,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2023-02-18 08:55:52,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 56 states have internal predecessors, (59), 16 states have call successors, (22), 12 states have call predecessors, (22), 7 states have return successors, (24), 7 states have call predecessors, (24), 13 states have call successors, (24) [2023-02-18 08:55:52,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 105 transitions. [2023-02-18 08:55:52,092 INFO L240 hiAutomatonCegarLoop]: Abstraction has 76 states and 105 transitions. [2023-02-18 08:55:52,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 08:55:52,093 INFO L428 stractBuchiCegarLoop]: Abstraction has 76 states and 105 transitions. [2023-02-18 08:55:52,093 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-02-18 08:55:52,093 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 105 transitions. [2023-02-18 08:55:52,094 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2023-02-18 08:55:52,094 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-18 08:55:52,094 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-18 08:55:52,095 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 08:55:52,095 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-18 08:55:52,095 INFO L748 eck$LassoCheckResult]: Stem: 1267#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 1235#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 1232#L29 assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 1233#L33 assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); 1234#L36 call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1);< 1236#$Ultimate##0 ~m := #in~m;~n := #in~n; 1283#L17 assume !(0 == ~m); 1282#L20 assume !(0 == ~n); 1238#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 1237#$Ultimate##0 ~m := #in~m;~n := #in~n; 1240#L17 assume !(0 == ~m); 1248#L20 assume 0 == ~n; 1250#L21 call #t~ret4 := ackermann(~m - 1, 1);< 1259#$Ultimate##0 ~m := #in~m;~n := #in~n; 1293#L17 assume !(0 == ~m); 1278#L20 [2023-02-18 08:55:52,095 INFO L750 eck$LassoCheckResult]: Loop: 1278#L20 assume !(0 == ~n); 1264#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 1265#$Ultimate##0 ~m := #in~m;~n := #in~n; 1279#L17 assume !(0 == ~m); 1278#L20 [2023-02-18 08:55:52,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:55:52,096 INFO L85 PathProgramCache]: Analyzing trace with hash -376751137, now seen corresponding path program 2 times [2023-02-18 08:55:52,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:55:52,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356972193] [2023-02-18 08:55:52,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:55:52,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:55:52,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:55:52,102 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 08:55:52,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:55:52,108 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 08:55:52,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:55:52,108 INFO L85 PathProgramCache]: Analyzing trace with hash 2009294, now seen corresponding path program 3 times [2023-02-18 08:55:52,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:55:52,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693290874] [2023-02-18 08:55:52,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:55:52,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:55:52,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:55:52,111 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 08:55:52,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:55:52,113 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 08:55:52,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:55:52,113 INFO L85 PathProgramCache]: Analyzing trace with hash 2009908652, now seen corresponding path program 3 times [2023-02-18 08:55:52,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:55:52,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785354118] [2023-02-18 08:55:52,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:55:52,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:55:52,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:55:52,119 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 08:55:52,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:55:52,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 08:55:52,129 INFO L210 LassoAnalysis]: Preferences: [2023-02-18 08:55:52,129 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-18 08:55:52,129 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-18 08:55:52,129 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-18 08:55:52,129 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-18 08:55:52,130 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:52,130 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-18 08:55:52,130 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-18 08:55:52,130 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration6_Loop [2023-02-18 08:55:52,130 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-18 08:55:52,130 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-18 08:55:52,130 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:52,131 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:52,132 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:52,132 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:52,133 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:52,134 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:52,136 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-18 08:55:52,136 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-18 08:55:52,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:52,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:52,138 INFO L229 MonitoredProcess]: Starting monitored process 87 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) [2023-02-18 08:55:52,147 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:52,147 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:52,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2023-02-18 08:55:52,155 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:52,155 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-18 08:55:52,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:52,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:52,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:52,159 INFO L229 MonitoredProcess]: Starting monitored process 88 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) [2023-02-18 08:55:52,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2023-02-18 08:55:52,162 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:52,162 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:52,169 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:52,169 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret5=0} Honda state: {ackermann_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-18 08:55:52,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:52,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:52,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:52,173 INFO L229 MonitoredProcess]: Starting monitored process 89 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) [2023-02-18 08:55:52,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2023-02-18 08:55:52,176 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:52,176 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:52,183 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:52,183 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret4=0} Honda state: {ackermann_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-18 08:55:52,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2023-02-18 08:55:52,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:52,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:52,187 INFO L229 MonitoredProcess]: Starting monitored process 90 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) [2023-02-18 08:55:52,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2023-02-18 08:55:52,190 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:52,190 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:52,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2023-02-18 08:55:52,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:52,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:52,207 INFO L229 MonitoredProcess]: Starting monitored process 91 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) [2023-02-18 08:55:52,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2023-02-18 08:55:52,210 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-18 08:55:52,210 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:52,320 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:52,321 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=-2, ackermann_#in~n=2} Honda state: {ackermann_~n=-2, ackermann_#in~n=2} Generalized eigenvectors: [{ackermann_~n=0, ackermann_#in~n=1}, {ackermann_~n=0, ackermann_#in~n=-5}, {ackermann_~n=-1, ackermann_#in~n=-1}] Lambdas: [5, 0, 1] Nus: [1, 0] [2023-02-18 08:55:52,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2023-02-18 08:55:52,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:52,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:52,325 INFO L229 MonitoredProcess]: Starting monitored process 92 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) [2023-02-18 08:55:52,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2023-02-18 08:55:52,328 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:52,328 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:52,343 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:52,343 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~m=-8, ackermann_~m=-8} Honda state: {ackermann_#in~m=-8, ackermann_~m=-8} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-18 08:55:52,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2023-02-18 08:55:52,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:52,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:52,347 INFO L229 MonitoredProcess]: Starting monitored process 93 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) [2023-02-18 08:55:52,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2023-02-18 08:55:52,351 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:52,351 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:52,358 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:52,358 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret6=0} Honda state: {ackermann_#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-18 08:55:52,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2023-02-18 08:55:52,385 INFO L210 LassoAnalysis]: Preferences: [2023-02-18 08:55:52,385 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-18 08:55:52,385 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-18 08:55:52,385 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-18 08:55:52,385 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-18 08:55:52,385 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:52,385 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-18 08:55:52,386 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-18 08:55:52,386 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration6_Lasso [2023-02-18 08:55:52,386 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-18 08:55:52,386 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-18 08:55:52,387 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:52,389 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:52,395 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:52,396 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:52,398 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:52,399 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:52,400 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:52,400 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:52,401 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:52,402 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:52,402 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:52,403 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:52,404 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:52,404 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:52,405 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:52,408 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:52,410 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:52,410 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:52,411 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:52,422 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:52,422 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:52,428 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-18 08:55:52,428 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-18 08:55:52,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:52,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:52,430 INFO L229 MonitoredProcess]: Starting monitored process 94 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) [2023-02-18 08:55:52,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:52,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:52,448 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2023-02-18 08:55:52,448 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-02-18 08:55:52,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:52,459 INFO L401 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2023-02-18 08:55:52,459 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-02-18 08:55:52,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2023-02-18 08:55:52,485 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:52,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:52,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:52,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:52,490 INFO L229 MonitoredProcess]: Starting monitored process 95 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) [2023-02-18 08:55:52,509 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:52,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:52,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:52,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:52,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:52,519 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-18 08:55:52,519 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-18 08:55:52,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2023-02-18 08:55:52,541 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:52,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:52,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:52,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:52,546 INFO L229 MonitoredProcess]: Starting monitored process 96 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) [2023-02-18 08:55:52,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2023-02-18 08:55:52,550 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:52,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:52,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:52,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:52,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:52,559 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-18 08:55:52,559 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-18 08:55:52,576 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:52,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:52,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:52,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:52,582 INFO L229 MonitoredProcess]: Starting monitored process 97 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) [2023-02-18 08:55:52,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2023-02-18 08:55:52,586 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:52,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:52,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:52,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:52,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:52,595 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-18 08:55:52,596 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-18 08:55:52,613 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:52,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:52,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:52,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:52,619 INFO L229 MonitoredProcess]: Starting monitored process 98 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) [2023-02-18 08:55:52,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2023-02-18 08:55:52,637 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:52,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:52,645 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:55:52,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:52,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:52,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:52,646 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:55:52,646 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:55:52,660 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:52,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:52,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:52,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:52,667 INFO L229 MonitoredProcess]: Starting monitored process 99 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) [2023-02-18 08:55:52,677 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:52,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:52,685 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:55:52,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:52,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:52,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:52,685 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:55:52,685 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:55:52,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2023-02-18 08:55:52,697 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:52,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:52,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:52,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:52,702 INFO L229 MonitoredProcess]: Starting monitored process 100 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) [2023-02-18 08:55:52,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2023-02-18 08:55:52,706 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:52,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:52,714 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:55:52,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:52,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:52,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:52,715 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:55:52,715 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:55:52,728 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:52,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:52,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:52,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:52,734 INFO L229 MonitoredProcess]: Starting monitored process 101 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) [2023-02-18 08:55:52,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2023-02-18 08:55:52,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:52,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:52,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:52,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:52,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:52,746 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-18 08:55:52,746 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-18 08:55:52,748 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:52,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2023-02-18 08:55:52,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:52,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:52,752 INFO L229 MonitoredProcess]: Starting monitored process 102 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) [2023-02-18 08:55:52,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2023-02-18 08:55:52,755 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:52,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:52,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:52,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:52,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:52,763 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-18 08:55:52,763 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-18 08:55:52,770 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:52,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:52,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:52,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:52,774 INFO L229 MonitoredProcess]: Starting monitored process 103 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) [2023-02-18 08:55:52,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2023-02-18 08:55:52,778 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:52,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:52,784 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:55:52,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:52,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:52,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:52,784 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:55:52,784 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:55:52,785 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:52,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:52,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:52,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:52,789 INFO L229 MonitoredProcess]: Starting monitored process 104 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) [2023-02-18 08:55:52,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2023-02-18 08:55:52,792 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:52,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:52,798 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:55:52,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:52,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:52,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:52,798 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:55:52,799 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:55:52,805 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:52,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:52,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:52,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:52,809 INFO L229 MonitoredProcess]: Starting monitored process 105 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) [2023-02-18 08:55:52,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2023-02-18 08:55:52,819 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:52,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:52,825 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:55:52,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:52,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:52,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:52,826 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:55:52,826 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:55:52,827 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:52,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2023-02-18 08:55:52,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:52,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:52,830 INFO L229 MonitoredProcess]: Starting monitored process 106 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) [2023-02-18 08:55:52,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2023-02-18 08:55:52,833 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:52,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:52,839 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:55:52,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:52,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:52,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:52,839 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:55:52,840 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:55:52,841 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:52,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2023-02-18 08:55:52,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:52,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:52,844 INFO L229 MonitoredProcess]: Starting monitored process 107 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) [2023-02-18 08:55:52,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2023-02-18 08:55:52,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:52,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:52,853 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:55:52,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:52,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:52,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:52,853 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:55:52,853 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:55:52,854 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:52,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2023-02-18 08:55:52,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:52,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:52,858 INFO L229 MonitoredProcess]: Starting monitored process 108 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) [2023-02-18 08:55:52,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2023-02-18 08:55:52,861 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:52,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:52,868 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:55:52,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:52,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:52,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:52,868 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:55:52,868 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:55:52,869 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:52,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:52,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:52,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:52,873 INFO L229 MonitoredProcess]: Starting monitored process 109 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) [2023-02-18 08:55:52,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2023-02-18 08:55:52,877 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:52,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:52,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:52,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:52,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:52,884 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-18 08:55:52,884 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-18 08:55:52,907 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:52,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0 [2023-02-18 08:55:52,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:52,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:52,915 INFO L229 MonitoredProcess]: Starting monitored process 110 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) [2023-02-18 08:55:52,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2023-02-18 08:55:52,919 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:52,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:52,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:52,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:52,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:52,929 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-18 08:55:52,929 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-18 08:55:52,935 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:52,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2023-02-18 08:55:52,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:52,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:52,940 INFO L229 MonitoredProcess]: Starting monitored process 111 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) [2023-02-18 08:55:52,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2023-02-18 08:55:52,943 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:52,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:52,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:52,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:52,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:52,952 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-18 08:55:52,952 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-18 08:55:52,956 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:52,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2023-02-18 08:55:52,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:52,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:52,960 INFO L229 MonitoredProcess]: Starting monitored process 112 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) [2023-02-18 08:55:52,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2023-02-18 08:55:52,963 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:52,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:52,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:52,969 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-02-18 08:55:52,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:52,974 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-02-18 08:55:52,974 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-02-18 08:55:53,004 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-18 08:55:53,017 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-02-18 08:55:53,017 INFO L444 ModelExtractionUtils]: 7 out of 16 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-02-18 08:55:53,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:53,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:53,025 INFO L229 MonitoredProcess]: Starting monitored process 113 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) [2023-02-18 08:55:53,029 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-18 08:55:53,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2023-02-18 08:55:53,059 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2023-02-18 08:55:53,059 INFO L513 LassoAnalysis]: Proved termination. [2023-02-18 08:55:53,059 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ackermann_~n) = 1*ackermann_~n Supporting invariants [1*ackermann_~n >= 0] [2023-02-18 08:55:53,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:53,066 INFO L156 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2023-02-18 08:55:53,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:55:53,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:53,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 08:55:53,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:55:53,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:53,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 08:55:53,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:55:53,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 08:55:53,166 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 4 loop predicates [2023-02-18 08:55:53,167 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 76 states and 105 transitions. cyclomatic complexity: 34 Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 08:55:53,188 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 76 states and 105 transitions. cyclomatic complexity: 34. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 77 states and 106 transitions. Complement of second has 6 states. [2023-02-18 08:55:53,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-02-18 08:55:53,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 08:55:53,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2023-02-18 08:55:53,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 15 letters. Loop has 4 letters. [2023-02-18 08:55:53,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:55:53,189 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-18 08:55:53,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:55:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:53,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 08:55:53,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:55:53,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:53,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 08:55:53,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:55:53,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 08:55:53,279 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 4 loop predicates [2023-02-18 08:55:53,279 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 76 states and 105 transitions. cyclomatic complexity: 34 Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 08:55:53,298 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 76 states and 105 transitions. cyclomatic complexity: 34. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 77 states and 106 transitions. Complement of second has 6 states. [2023-02-18 08:55:53,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-02-18 08:55:53,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 08:55:53,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2023-02-18 08:55:53,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 15 letters. Loop has 4 letters. [2023-02-18 08:55:53,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:55:53,300 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-18 08:55:53,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:55:53,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:53,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 08:55:53,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:55:53,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:53,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 08:55:53,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:55:53,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 08:55:53,400 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 4 loop predicates [2023-02-18 08:55:53,400 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 76 states and 105 transitions. cyclomatic complexity: 34 Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 08:55:53,489 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 76 states and 105 transitions. cyclomatic complexity: 34. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 171 states and 230 transitions. Complement of second has 38 states. [2023-02-18 08:55:53,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 3 stem states 3 non-accepting loop states 2 accepting loop states [2023-02-18 08:55:53,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 08:55:53,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2023-02-18 08:55:53,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 15 letters. Loop has 4 letters. [2023-02-18 08:55:53,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:55:53,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 19 letters. Loop has 4 letters. [2023-02-18 08:55:53,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:55:53,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 15 letters. Loop has 8 letters. [2023-02-18 08:55:53,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:55:53,492 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 171 states and 230 transitions. [2023-02-18 08:55:53,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2023-02-18 08:55:53,496 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 171 states to 113 states and 162 transitions. [2023-02-18 08:55:53,496 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2023-02-18 08:55:53,497 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2023-02-18 08:55:53,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 162 transitions. [2023-02-18 08:55:53,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-18 08:55:53,497 INFO L218 hiAutomatonCegarLoop]: Abstraction has 113 states and 162 transitions. [2023-02-18 08:55:53,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 162 transitions. [2023-02-18 08:55:53,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2023-02-18 08:55:53,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 76 states have (on average 1.131578947368421) internal successors, (86), 79 states have internal predecessors, (86), 22 states have call successors, (29), 17 states have call predecessors, (29), 10 states have return successors, (35), 11 states have call predecessors, (35), 20 states have call successors, (35) [2023-02-18 08:55:53,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 150 transitions. [2023-02-18 08:55:53,510 INFO L240 hiAutomatonCegarLoop]: Abstraction has 108 states and 150 transitions. [2023-02-18 08:55:53,511 INFO L428 stractBuchiCegarLoop]: Abstraction has 108 states and 150 transitions. [2023-02-18 08:55:53,511 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-02-18 08:55:53,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states and 150 transitions. [2023-02-18 08:55:53,512 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2023-02-18 08:55:53,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-18 08:55:53,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-18 08:55:53,513 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 08:55:53,513 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 08:55:53,513 INFO L748 eck$LassoCheckResult]: Stem: 1944#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 1906#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 1903#L29 assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 1904#L33 assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); 1905#L36 call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1);< 1907#$Ultimate##0 ~m := #in~m;~n := #in~n; 1908#L17 assume !(0 == ~m); 1922#L20 assume !(0 == ~n); 1949#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 1970#$Ultimate##0 ~m := #in~m;~n := #in~n; 1989#L17 assume !(0 == ~m); 1988#L20 assume 0 == ~n; 1918#L21 call #t~ret4 := ackermann(~m - 1, 1);< 1961#$Ultimate##0 ~m := #in~m;~n := #in~n; 1987#L17 assume 0 == ~m;#res := 1 + ~n; 1985#ackermannFINAL assume true; 1976#ackermannEXIT >#43#return; 1973#L21-1 #res := #t~ret4;havoc #t~ret4; 1969#ackermannFINAL assume true; 1952#ackermannEXIT >#45#return; 1939#L23-1 [2023-02-18 08:55:53,513 INFO L750 eck$LassoCheckResult]: Loop: 1939#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 1942#$Ultimate##0 ~m := #in~m;~n := #in~n; 1974#L17 assume !(0 == ~m); 1975#L20 assume !(0 == ~n); 1938#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 1942#$Ultimate##0 ~m := #in~m;~n := #in~n; 1974#L17 assume !(0 == ~m); 1975#L20 assume 0 == ~n; 1915#L21 call #t~ret4 := ackermann(~m - 1, 1);< 1932#$Ultimate##0 ~m := #in~m;~n := #in~n; 1966#L17 assume 0 == ~m;#res := 1 + ~n; 1964#ackermannFINAL assume true; 1957#ackermannEXIT >#43#return; 1956#L21-1 #res := #t~ret4;havoc #t~ret4; 1955#ackermannFINAL assume true; 1948#ackermannEXIT >#45#return; 1939#L23-1 [2023-02-18 08:55:53,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:55:53,514 INFO L85 PathProgramCache]: Analyzing trace with hash -2142297082, now seen corresponding path program 1 times [2023-02-18 08:55:53,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:55:53,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447170473] [2023-02-18 08:55:53,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:55:53,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:55:53,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:55:53,520 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 08:55:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:55:53,527 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 08:55:53,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:55:53,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1250092377, now seen corresponding path program 1 times [2023-02-18 08:55:53,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:55:53,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6785409] [2023-02-18 08:55:53,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:55:53,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:55:53,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:55:53,532 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 08:55:53,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:55:53,536 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 08:55:53,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:55:53,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1017421986, now seen corresponding path program 1 times [2023-02-18 08:55:53,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:55:53,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850747647] [2023-02-18 08:55:53,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:55:53,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:55:53,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:53,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-18 08:55:53,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:53,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:53,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:55:53,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:53,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-18 08:55:53,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:53,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:55:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:53,738 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 22 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-02-18 08:55:53,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:55:53,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850747647] [2023-02-18 08:55:53,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850747647] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 08:55:53,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889077737] [2023-02-18 08:55:53,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:55:53,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 08:55:53,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:53,741 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 08:55:53,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Waiting until timeout for monitored process [2023-02-18 08:55:53,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:53,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-18 08:55:53,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:55:53,834 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 17 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-18 08:55:53,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 08:55:53,905 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 22 proven. 14 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-18 08:55:53,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889077737] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 08:55:53,905 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 08:55:53,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2023-02-18 08:55:53,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575348237] [2023-02-18 08:55:53,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 08:55:53,913 INFO L210 LassoAnalysis]: Preferences: [2023-02-18 08:55:53,913 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-18 08:55:53,913 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-18 08:55:53,913 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-18 08:55:53,913 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-18 08:55:53,913 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:53,914 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-18 08:55:53,914 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-18 08:55:53,914 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration7_Loop [2023-02-18 08:55:53,914 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-18 08:55:53,914 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-18 08:55:53,915 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:53,916 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:53,916 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:53,917 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:53,918 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:53,921 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-18 08:55:53,921 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-18 08:55:53,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:53,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:53,922 INFO L229 MonitoredProcess]: Starting monitored process 115 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) [2023-02-18 08:55:53,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2023-02-18 08:55:53,926 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:53,926 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:53,958 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:53,958 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-18 08:55:53,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:53,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:53,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:53,964 INFO L229 MonitoredProcess]: Starting monitored process 116 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) [2023-02-18 08:55:53,973 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:53,973 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:53,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2023-02-18 08:55:53,993 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:53,993 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret6=0} Honda state: {ackermann_#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-18 08:55:53,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:53,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:53,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:53,998 INFO L229 MonitoredProcess]: Starting monitored process 117 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) [2023-02-18 08:55:54,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2023-02-18 08:55:54,002 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:54,002 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:54,029 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:54,029 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret4=0} Honda state: {ackermann_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-18 08:55:54,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:54,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:54,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:54,035 INFO L229 MonitoredProcess]: Starting monitored process 118 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) [2023-02-18 08:55:54,045 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:54,045 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:54,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2023-02-18 08:55:54,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:54,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:54,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:54,071 INFO L229 MonitoredProcess]: Starting monitored process 119 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) [2023-02-18 08:55:54,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2023-02-18 08:55:54,074 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-18 08:55:54,074 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:54,964 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-18 08:55:54,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:54,968 INFO L210 LassoAnalysis]: Preferences: [2023-02-18 08:55:54,968 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-18 08:55:54,968 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-18 08:55:54,968 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-18 08:55:54,968 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-18 08:55:54,968 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:54,968 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-18 08:55:54,968 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-18 08:55:54,968 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration7_Loop [2023-02-18 08:55:54,968 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-18 08:55:54,969 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-18 08:55:54,969 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:54,970 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:54,970 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:54,985 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:54,986 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:54,989 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-18 08:55:54,989 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-18 08:55:54,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:54,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:54,990 INFO L229 MonitoredProcess]: Starting monitored process 120 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) [2023-02-18 08:55:55,001 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:55,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:55,009 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:55:55,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:55,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:55,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:55,009 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:55:55,009 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:55:55,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2023-02-18 08:55:55,025 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:55,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:55,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:55,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:55,030 INFO L229 MonitoredProcess]: Starting monitored process 121 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) [2023-02-18 08:55:55,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2023-02-18 08:55:55,033 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:55,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:55,041 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:55:55,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:55,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:55,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:55,041 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:55:55,041 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:55:55,055 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:55,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:55,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:55,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:55,061 INFO L229 MonitoredProcess]: Starting monitored process 122 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) [2023-02-18 08:55:55,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2023-02-18 08:55:55,066 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:55,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:55,072 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:55:55,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:55,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:55:55,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:55,073 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:55:55,073 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:55:55,074 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:55:55,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2023-02-18 08:55:55,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:55,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:55,078 INFO L229 MonitoredProcess]: Starting monitored process 123 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) [2023-02-18 08:55:55,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2023-02-18 08:55:55,081 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:55:55,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:55:55,088 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:55:55,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:55:55,088 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-02-18 08:55:55,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:55:55,091 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-18 08:55:55,091 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:55:55,102 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-18 08:55:55,105 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2023-02-18 08:55:55,105 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-18 08:55:55,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:55,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:55,108 INFO L229 MonitoredProcess]: Starting monitored process 124 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) [2023-02-18 08:55:55,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2023-02-18 08:55:55,109 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-18 08:55:55,109 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-18 08:55:55,109 INFO L513 LassoAnalysis]: Proved termination. [2023-02-18 08:55:55,109 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ackermann_~m) = 1*ackermann_~m Supporting invariants [] [2023-02-18 08:55:55,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:55,112 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-18 08:55:55,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:55:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:55,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 08:55:55,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:55:55,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:55,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-18 08:55:55,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:55:55,221 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-18 08:55:55,222 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2023-02-18 08:55:55,222 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 108 states and 150 transitions. cyclomatic complexity: 46 Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 08:55:55,289 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 108 states and 150 transitions. cyclomatic complexity: 46. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Result 185 states and 266 transitions. Complement of second has 20 states. [2023-02-18 08:55:55,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2023-02-18 08:55:55,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 08:55:55,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2023-02-18 08:55:55,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 25 transitions. Stem has 20 letters. Loop has 16 letters. [2023-02-18 08:55:55,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:55:55,291 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-18 08:55:55,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:55:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:55,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 08:55:55,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:55:55,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:55,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-18 08:55:55,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:55:55,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:55,408 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-18 08:55:55,409 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates [2023-02-18 08:55:55,409 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 108 states and 150 transitions. cyclomatic complexity: 46 Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 08:55:55,539 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 108 states and 150 transitions. cyclomatic complexity: 46. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Result 272 states and 409 transitions. Complement of second has 32 states. [2023-02-18 08:55:55,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2023-02-18 08:55:55,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 08:55:55,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2023-02-18 08:55:55,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 20 letters. Loop has 16 letters. [2023-02-18 08:55:55,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:55:55,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 36 letters. Loop has 16 letters. [2023-02-18 08:55:55,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:55:55,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 20 letters. Loop has 32 letters. [2023-02-18 08:55:55,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:55:55,542 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 272 states and 409 transitions. [2023-02-18 08:55:55,545 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 47 [2023-02-18 08:55:55,550 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 272 states to 222 states and 347 transitions. [2023-02-18 08:55:55,550 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2023-02-18 08:55:55,550 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2023-02-18 08:55:55,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 222 states and 347 transitions. [2023-02-18 08:55:55,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-18 08:55:55,551 INFO L218 hiAutomatonCegarLoop]: Abstraction has 222 states and 347 transitions. [2023-02-18 08:55:55,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states and 347 transitions. [2023-02-18 08:55:55,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 209. [2023-02-18 08:55:55,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 138 states have (on average 1.1666666666666667) internal successors, (161), 148 states have internal predecessors, (161), 47 states have call successors, (64), 28 states have call predecessors, (64), 24 states have return successors, (102), 32 states have call predecessors, (102), 41 states have call successors, (102) [2023-02-18 08:55:55,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 327 transitions. [2023-02-18 08:55:55,565 INFO L240 hiAutomatonCegarLoop]: Abstraction has 209 states and 327 transitions. [2023-02-18 08:55:55,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 08:55:55,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-18 08:55:55,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-02-18 08:55:55,566 INFO L87 Difference]: Start difference. First operand 209 states and 327 transitions. Second operand has 16 states, 14 states have (on average 2.5) internal successors, (35), 12 states have internal predecessors, (35), 5 states have call successors, (7), 2 states have call predecessors, (7), 7 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-18 08:55:55,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 08:55:55,732 INFO L93 Difference]: Finished difference Result 232 states and 364 transitions. [2023-02-18 08:55:55,732 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 232 states and 364 transitions. [2023-02-18 08:55:55,736 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 53 [2023-02-18 08:55:55,740 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 232 states to 230 states and 362 transitions. [2023-02-18 08:55:55,740 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2023-02-18 08:55:55,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2023-02-18 08:55:55,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 230 states and 362 transitions. [2023-02-18 08:55:55,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-18 08:55:55,741 INFO L218 hiAutomatonCegarLoop]: Abstraction has 230 states and 362 transitions. [2023-02-18 08:55:55,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states and 362 transitions. [2023-02-18 08:55:55,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 223. [2023-02-18 08:55:55,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 147 states have (on average 1.1360544217687074) internal successors, (167), 157 states have internal predecessors, (167), 48 states have call successors, (63), 30 states have call predecessors, (63), 28 states have return successors, (121), 35 states have call predecessors, (121), 42 states have call successors, (121) [2023-02-18 08:55:55,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 351 transitions. [2023-02-18 08:55:55,754 INFO L240 hiAutomatonCegarLoop]: Abstraction has 223 states and 351 transitions. [2023-02-18 08:55:55,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 08:55:55,755 INFO L428 stractBuchiCegarLoop]: Abstraction has 223 states and 351 transitions. [2023-02-18 08:55:55,755 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-02-18 08:55:55,755 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 223 states and 351 transitions. [2023-02-18 08:55:55,757 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 53 [2023-02-18 08:55:55,757 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-18 08:55:55,757 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-18 08:55:55,758 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 08:55:55,758 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-18 08:55:55,758 INFO L748 eck$LassoCheckResult]: Stem: 3556#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 3503#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 3500#L29 assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 3501#L33 assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); 3502#L36 call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1);< 3504#$Ultimate##0 ~m := #in~m;~n := #in~n; 3589#L17 assume !(0 == ~m); 3587#L20 assume !(0 == ~n); 3514#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 3583#$Ultimate##0 ~m := #in~m;~n := #in~n; 3584#L17 assume !(0 == ~m); 3601#L20 assume 0 == ~n; 3540#L21 call #t~ret4 := ackermann(~m - 1, 1);< 3599#$Ultimate##0 ~m := #in~m;~n := #in~n; 3602#L17 assume 0 == ~m;#res := 1 + ~n; 3600#ackermannFINAL assume true; 3595#ackermannEXIT >#43#return; 3594#L21-1 #res := #t~ret4;havoc #t~ret4; 3593#ackermannFINAL assume true; 3591#ackermannEXIT >#45#return; 3537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 3545#$Ultimate##0 ~m := #in~m;~n := #in~n; 3677#L17 assume !(0 == ~m); 3531#L20 assume !(0 == ~n); 3534#L23 [2023-02-18 08:55:55,758 INFO L750 eck$LassoCheckResult]: Loop: 3534#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 3645#$Ultimate##0 ~m := #in~m;~n := #in~n; 3642#L17 assume !(0 == ~m); 3643#L20 assume !(0 == ~n); 3534#L23 [2023-02-18 08:55:55,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:55:55,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1132004457, now seen corresponding path program 2 times [2023-02-18 08:55:55,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:55:55,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087379842] [2023-02-18 08:55:55,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:55:55,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:55:55,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:55,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-18 08:55:55,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:55,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:55:55,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:55,842 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 08:55:55,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:55:55,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087379842] [2023-02-18 08:55:55,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087379842] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 08:55:55,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263615988] [2023-02-18 08:55:55,843 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 08:55:55,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 08:55:55,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:55,844 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 08:55:55,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Waiting until timeout for monitored process [2023-02-18 08:55:55,886 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 08:55:55,886 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 08:55:55,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-18 08:55:55,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:55:55,910 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 08:55:55,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 08:55:55,950 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-18 08:55:55,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263615988] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 08:55:55,951 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 08:55:55,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 9 [2023-02-18 08:55:55,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942068224] [2023-02-18 08:55:55,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 08:55:55,952 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-18 08:55:55,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:55:55,953 INFO L85 PathProgramCache]: Analyzing trace with hash 2259284, now seen corresponding path program 4 times [2023-02-18 08:55:55,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:55:55,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667440660] [2023-02-18 08:55:55,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:55:55,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:55:55,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:55:55,964 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 08:55:55,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:55:55,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 08:55:55,970 INFO L210 LassoAnalysis]: Preferences: [2023-02-18 08:55:55,970 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-18 08:55:55,970 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-18 08:55:55,970 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-18 08:55:55,970 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-18 08:55:55,970 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:55,970 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-18 08:55:55,971 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-18 08:55:55,971 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration8_Loop [2023-02-18 08:55:55,971 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-18 08:55:55,971 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-18 08:55:55,972 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:55,972 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:55,973 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:55,974 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:55,975 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:55,975 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:55,981 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-18 08:55:55,981 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-18 08:55:55,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:55,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:55,983 INFO L229 MonitoredProcess]: Starting monitored process 126 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) [2023-02-18 08:55:55,993 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:55,993 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:56,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2023-02-18 08:55:56,017 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:56,017 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret4=0} Honda state: {ackermann_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-18 08:55:56,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:56,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:56,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:56,022 INFO L229 MonitoredProcess]: Starting monitored process 127 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) [2023-02-18 08:55:56,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2023-02-18 08:55:56,026 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:56,027 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:56,047 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:56,047 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret5=0} Honda state: {ackermann_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-18 08:55:56,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:56,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:56,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:56,053 INFO L229 MonitoredProcess]: Starting monitored process 128 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) [2023-02-18 08:55:56,057 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:56,057 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:56,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2023-02-18 08:55:56,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:56,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:56,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:56,094 INFO L229 MonitoredProcess]: Starting monitored process 129 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) [2023-02-18 08:55:56,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2023-02-18 08:55:56,098 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-18 08:55:56,098 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:57,119 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:57,119 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=-8, ackermann_#in~n=-2} Honda state: {ackermann_~n=-8, ackermann_#in~n=-2} Generalized eigenvectors: [{ackermann_~n=0, ackermann_#in~n=-8}, {ackermann_~n=0, ackermann_#in~n=2}, {ackermann_~n=-1, ackermann_#in~n=-1}] Lambdas: [0, 0, 1] Nus: [0, 0] [2023-02-18 08:55:57,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:57,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:57,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:57,124 INFO L229 MonitoredProcess]: Starting monitored process 130 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) [2023-02-18 08:55:57,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2023-02-18 08:55:57,127 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:57,127 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:57,135 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:57,135 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-18 08:55:57,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:57,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:57,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:57,139 INFO L229 MonitoredProcess]: Starting monitored process 131 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) [2023-02-18 08:55:57,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2023-02-18 08:55:57,142 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:57,142 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:57,149 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:57,149 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret6=0} Honda state: {ackermann_#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-18 08:55:57,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Ended with exit code 0 [2023-02-18 08:55:57,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:57,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:57,153 INFO L229 MonitoredProcess]: Starting monitored process 132 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) [2023-02-18 08:55:57,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2023-02-18 08:55:57,156 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:57,156 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:57,169 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:57,169 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~m=-8, ackermann_~m=-8} Honda state: {ackermann_#in~m=-8, ackermann_~m=-8} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-18 08:55:57,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:57,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 08:55:57,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-18 08:55:57,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-18 08:55:57,173 INFO L87 Difference]: Start difference. First operand 223 states and 351 transitions. cyclomatic complexity: 135 Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-18 08:55:57,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 08:55:57,268 INFO L93 Difference]: Finished difference Result 169 states and 264 transitions. [2023-02-18 08:55:57,268 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 264 transitions. [2023-02-18 08:55:57,270 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2023-02-18 08:55:57,273 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 161 states and 238 transitions. [2023-02-18 08:55:57,273 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 113 [2023-02-18 08:55:57,273 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2023-02-18 08:55:57,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 161 states and 238 transitions. [2023-02-18 08:55:57,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-18 08:55:57,273 INFO L218 hiAutomatonCegarLoop]: Abstraction has 161 states and 238 transitions. [2023-02-18 08:55:57,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states and 238 transitions. [2023-02-18 08:55:57,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 155. [2023-02-18 08:55:57,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 104 states have (on average 1.0961538461538463) internal successors, (114), 105 states have internal predecessors, (114), 31 states have call successors, (37), 23 states have call predecessors, (37), 20 states have return successors, (64), 26 states have call predecessors, (64), 29 states have call successors, (64) [2023-02-18 08:55:57,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 215 transitions. [2023-02-18 08:55:57,280 INFO L240 hiAutomatonCegarLoop]: Abstraction has 155 states and 215 transitions. [2023-02-18 08:55:57,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 08:55:57,281 INFO L428 stractBuchiCegarLoop]: Abstraction has 155 states and 215 transitions. [2023-02-18 08:55:57,281 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-02-18 08:55:57,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 155 states and 215 transitions. [2023-02-18 08:55:57,283 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2023-02-18 08:55:57,283 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-18 08:55:57,283 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-18 08:55:57,288 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 7, 7, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-02-18 08:55:57,288 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [14, 11, 9, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2] [2023-02-18 08:55:57,288 INFO L748 eck$LassoCheckResult]: Stem: 4088#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 4065#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 4063#L29 assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 4064#L33 assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); 4052#L36 call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1);< 4066#$Ultimate##0 ~m := #in~m;~n := #in~n; 4139#L17 assume !(0 == ~m); 4135#L20 assume 0 == ~n; 4084#L21 call #t~ret4 := ackermann(~m - 1, 1);< 4085#$Ultimate##0 ~m := #in~m;~n := #in~n; 4157#L17 assume !(0 == ~m); 4156#L20 assume !(0 == ~n); 4090#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 4091#$Ultimate##0 ~m := #in~m;~n := #in~n; 4165#L17 assume !(0 == ~m); 4164#L20 assume !(0 == ~n); 4054#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 4070#$Ultimate##0 ~m := #in~m;~n := #in~n; 4071#L17 assume !(0 == ~m); 4133#L20 assume 0 == ~n; 4112#L21 call #t~ret4 := ackermann(~m - 1, 1);< 4119#$Ultimate##0 ~m := #in~m;~n := #in~n; 4147#L17 assume !(0 == ~m); 4145#L20 assume !(0 == ~n); 4106#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 4141#$Ultimate##0 ~m := #in~m;~n := #in~n; 4167#L17 assume !(0 == ~m); 4166#L20 assume !(0 == ~n); 4059#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 4163#$Ultimate##0 ~m := #in~m;~n := #in~n; 4160#L17 assume !(0 == ~m); 4133#L20 assume 0 == ~n; 4112#L21 call #t~ret4 := ackermann(~m - 1, 1);< 4120#$Ultimate##0 ~m := #in~m;~n := #in~n; 4155#L17 assume 0 == ~m;#res := 1 + ~n; 4154#ackermannFINAL assume true; 4151#ackermannEXIT >#43#return; 4152#L21-1 #res := #t~ret4;havoc #t~ret4; 4201#ackermannFINAL assume true; 4198#ackermannEXIT >#45#return; 4189#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 4082#$Ultimate##0 ~m := #in~m;~n := #in~n; 4199#L17 assume 0 == ~m;#res := 1 + ~n; 4196#ackermannFINAL assume true; 4188#ackermannEXIT >#47#return; 4180#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 4178#ackermannFINAL assume true; 4174#ackermannEXIT >#45#return; 4068#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 4067#$Ultimate##0 ~m := #in~m;~n := #in~n; 4069#L17 assume 0 == ~m;#res := 1 + ~n; 4077#ackermannFINAL assume true; 4170#ackermannEXIT >#47#return; 4107#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 4159#ackermannFINAL assume true; 4117#ackermannEXIT >#43#return; 4086#L21-1 #res := #t~ret4;havoc #t~ret4; 4049#ackermannFINAL assume true; 4062#ackermannEXIT >#45#return; 4051#L23-1 [2023-02-18 08:55:57,288 INFO L750 eck$LassoCheckResult]: Loop: 4051#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 4089#$Ultimate##0 ~m := #in~m;~n := #in~n; 4128#L17 assume !(0 == ~m); 4125#L20 assume 0 == ~n; 4074#L21 call #t~ret4 := ackermann(~m - 1, 1);< 4083#$Ultimate##0 ~m := #in~m;~n := #in~n; 4115#L17 assume !(0 == ~m); 4113#L20 assume !(0 == ~n); 4096#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 4103#$Ultimate##0 ~m := #in~m;~n := #in~n; 4134#L17 assume !(0 == ~m); 4131#L20 assume !(0 == ~n); 4058#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 4102#$Ultimate##0 ~m := #in~m;~n := #in~n; 4098#L17 assume !(0 == ~m); 4099#L20 assume 0 == ~n; 4074#L21 call #t~ret4 := ackermann(~m - 1, 1);< 4083#$Ultimate##0 ~m := #in~m;~n := #in~n; 4115#L17 assume !(0 == ~m); 4113#L20 assume !(0 == ~n); 4096#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 4103#$Ultimate##0 ~m := #in~m;~n := #in~n; 4134#L17 assume !(0 == ~m); 4131#L20 assume !(0 == ~n); 4058#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 4102#$Ultimate##0 ~m := #in~m;~n := #in~n; 4098#L17 assume !(0 == ~m); 4100#L20 assume !(0 == ~n); 4061#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 4102#$Ultimate##0 ~m := #in~m;~n := #in~n; 4098#L17 assume !(0 == ~m); 4100#L20 assume !(0 == ~n); 4061#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 4102#$Ultimate##0 ~m := #in~m;~n := #in~n; 4098#L17 assume !(0 == ~m); 4099#L20 assume 0 == ~n; 4074#L21 call #t~ret4 := ackermann(~m - 1, 1);< 4083#$Ultimate##0 ~m := #in~m;~n := #in~n; 4115#L17 assume 0 == ~m;#res := 1 + ~n; 4116#ackermannFINAL assume true; 4072#ackermannEXIT >#43#return; 4076#L21-1 #res := #t~ret4;havoc #t~ret4; 4203#ackermannFINAL assume true; 4121#ackermannEXIT >#45#return; 4123#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 4187#$Ultimate##0 ~m := #in~m;~n := #in~n; 4200#L17 assume 0 == ~m;#res := 1 + ~n; 4197#ackermannFINAL assume true; 4185#ackermannEXIT >#47#return; 4184#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 4194#ackermannFINAL assume true; 4192#ackermannEXIT >#45#return; 4182#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 4186#$Ultimate##0 ~m := #in~m;~n := #in~n; 4193#L17 assume 0 == ~m;#res := 1 + ~n; 4129#ackermannFINAL assume true; 4181#ackermannEXIT >#47#return; 4184#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 4194#ackermannFINAL assume true; 4192#ackermannEXIT >#45#return; 4183#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 4186#$Ultimate##0 ~m := #in~m;~n := #in~n; 4193#L17 assume 0 == ~m;#res := 1 + ~n; 4129#ackermannFINAL assume true; 4181#ackermannEXIT >#47#return; 4179#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 4176#ackermannFINAL assume true; 4175#ackermannEXIT >#45#return; 4068#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 4067#$Ultimate##0 ~m := #in~m;~n := #in~n; 4069#L17 assume 0 == ~m;#res := 1 + ~n; 4077#ackermannFINAL assume true; 4170#ackermannEXIT >#47#return; 4107#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 4159#ackermannFINAL assume true; 4117#ackermannEXIT >#43#return; 4086#L21-1 #res := #t~ret4;havoc #t~ret4; 4049#ackermannFINAL assume true; 4062#ackermannEXIT >#45#return; 4051#L23-1 [2023-02-18 08:55:57,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:55:57,289 INFO L85 PathProgramCache]: Analyzing trace with hash -2019866079, now seen corresponding path program 1 times [2023-02-18 08:55:57,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:55:57,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649926904] [2023-02-18 08:55:57,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:55:57,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:55:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:57,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-18 08:55:57,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:57,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:55:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:57,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:55:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:57,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:55:57,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:57,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:55:57,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:57,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:55:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:57,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:55:57,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:57,402 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 22 proven. 54 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2023-02-18 08:55:57,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:55:57,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649926904] [2023-02-18 08:55:57,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649926904] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 08:55:57,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850699268] [2023-02-18 08:55:57,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:55:57,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 08:55:57,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:57,404 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 08:55:57,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (133)] Waiting until timeout for monitored process [2023-02-18 08:55:57,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:57,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-18 08:55:57,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:55:57,496 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 26 proven. 50 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2023-02-18 08:55:57,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 08:55:57,551 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 26 proven. 50 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2023-02-18 08:55:57,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850699268] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 08:55:57,551 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 08:55:57,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2023-02-18 08:55:57,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978330712] [2023-02-18 08:55:57,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 08:55:57,556 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-18 08:55:57,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:55:57,557 INFO L85 PathProgramCache]: Analyzing trace with hash -431501854, now seen corresponding path program 1 times [2023-02-18 08:55:57,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:55:57,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523053485] [2023-02-18 08:55:57,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:55:57,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:55:57,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:57,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-18 08:55:57,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:57,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:55:57,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:57,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:55:57,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:57,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:55:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:57,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:55:57,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:57,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:55:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:57,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:55:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:57,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:55:57,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:57,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:55:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:57,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:55:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:57,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:55:57,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:57,781 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 34 proven. 80 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2023-02-18 08:55:57,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:55:57,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523053485] [2023-02-18 08:55:57,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523053485] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 08:55:57,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191782945] [2023-02-18 08:55:57,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:55:57,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 08:55:57,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:57,785 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 08:55:57,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (134)] Waiting until timeout for monitored process [2023-02-18 08:55:57,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:57,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-18 08:55:57,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:55:57,861 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 34 proven. 80 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2023-02-18 08:55:57,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 08:55:57,907 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 34 proven. 80 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2023-02-18 08:55:57,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191782945] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 08:55:57,907 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 08:55:57,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2023-02-18 08:55:57,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464038534] [2023-02-18 08:55:57,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 08:55:57,909 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-18 08:55:57,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 08:55:57,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-18 08:55:57,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-02-18 08:55:57,910 INFO L87 Difference]: Start difference. First operand 155 states and 215 transitions. cyclomatic complexity: 64 Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 9 states have internal predecessors, (34), 6 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-02-18 08:55:58,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 08:55:58,004 INFO L93 Difference]: Finished difference Result 135 states and 191 transitions. [2023-02-18 08:55:58,004 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 191 transitions. [2023-02-18 08:55:58,006 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2023-02-18 08:55:58,008 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 130 states and 186 transitions. [2023-02-18 08:55:58,008 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 107 [2023-02-18 08:55:58,008 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 110 [2023-02-18 08:55:58,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 130 states and 186 transitions. [2023-02-18 08:55:58,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-18 08:55:58,008 INFO L218 hiAutomatonCegarLoop]: Abstraction has 130 states and 186 transitions. [2023-02-18 08:55:58,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states and 186 transitions. [2023-02-18 08:55:58,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 107. [2023-02-18 08:55:58,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 71 states have (on average 1.0845070422535212) internal successors, (77), 72 states have internal predecessors, (77), 21 states have call successors, (23), 15 states have call predecessors, (23), 15 states have return successors, (38), 19 states have call predecessors, (38), 19 states have call successors, (38) [2023-02-18 08:55:58,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 138 transitions. [2023-02-18 08:55:58,013 INFO L240 hiAutomatonCegarLoop]: Abstraction has 107 states and 138 transitions. [2023-02-18 08:55:58,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 08:55:58,014 INFO L428 stractBuchiCegarLoop]: Abstraction has 107 states and 138 transitions. [2023-02-18 08:55:58,014 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-02-18 08:55:58,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 138 transitions. [2023-02-18 08:55:58,015 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2023-02-18 08:55:58,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-18 08:55:58,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-18 08:55:58,017 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 08:55:58,017 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [13, 12, 9, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3] [2023-02-18 08:55:58,017 INFO L748 eck$LassoCheckResult]: Stem: 5607#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 5576#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 5573#L29 assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 5574#L33 assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); 5575#L36 call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1);< 5577#$Ultimate##0 ~m := #in~m;~n := #in~n; 5620#L17 assume !(0 == ~m); 5619#L20 assume !(0 == ~n); 5592#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 5611#$Ultimate##0 ~m := #in~m;~n := #in~n; 5631#L17 assume !(0 == ~m); 5591#L20 assume 0 == ~n; 5593#L21 call #t~ret4 := ackermann(~m - 1, 1);< 5639#$Ultimate##0 ~m := #in~m;~n := #in~n; 5662#L17 assume !(0 == ~m); 5660#L20 assume !(0 == ~n); 5585#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 5582#$Ultimate##0 ~m := #in~m;~n := #in~n; 5584#L17 assume !(0 == ~m); 5590#L20 assume 0 == ~n; 5594#L21 call #t~ret4 := ackermann(~m - 1, 1);< 5651#$Ultimate##0 ~m := #in~m;~n := #in~n; 5653#L17 assume 0 == ~m;#res := 1 + ~n; 5652#ackermannFINAL assume true; 5634#ackermannEXIT >#43#return; 5635#L21-1 #res := #t~ret4;havoc #t~ret4; 5665#ackermannFINAL assume true; 5659#ackermannEXIT >#45#return; 5657#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 5658#$Ultimate##0 ~m := #in~m;~n := #in~n; 5664#L17 assume 0 == ~m;#res := 1 + ~n; 5663#ackermannFINAL assume true; 5656#ackermannEXIT >#47#return; 5655#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 5654#ackermannFINAL assume true; 5650#ackermannEXIT >#43#return; 5637#L21-1 #res := #t~ret4;havoc #t~ret4; 5670#ackermannFINAL assume true; 5668#ackermannEXIT >#45#return; 5600#L23-1 [2023-02-18 08:55:58,017 INFO L750 eck$LassoCheckResult]: Loop: 5600#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 5626#$Ultimate##0 ~m := #in~m;~n := #in~n; 5622#L17 assume !(0 == ~m); 5624#L20 assume !(0 == ~n); 5598#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 5626#$Ultimate##0 ~m := #in~m;~n := #in~n; 5622#L17 assume !(0 == ~m); 5624#L20 assume 0 == ~n; 5597#L21 call #t~ret4 := ackermann(~m - 1, 1);< 5602#$Ultimate##0 ~m := #in~m;~n := #in~n; 5616#L17 assume !(0 == ~m); 5615#L20 assume !(0 == ~n); 5608#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 5610#$Ultimate##0 ~m := #in~m;~n := #in~n; 5630#L17 assume !(0 == ~m); 5613#L20 assume 0 == ~n; 5609#L21 call #t~ret4 := ackermann(~m - 1, 1);< 5602#$Ultimate##0 ~m := #in~m;~n := #in~n; 5616#L17 assume !(0 == ~m); 5615#L20 assume !(0 == ~n); 5608#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 5610#$Ultimate##0 ~m := #in~m;~n := #in~n; 5630#L17 assume !(0 == ~m); 5613#L20 assume 0 == ~n; 5609#L21 call #t~ret4 := ackermann(~m - 1, 1);< 5602#$Ultimate##0 ~m := #in~m;~n := #in~n; 5616#L17 assume 0 == ~m;#res := 1 + ~n; 5617#ackermannFINAL assume true; 5632#ackermannEXIT >#43#return; 5633#L21-1 #res := #t~ret4;havoc #t~ret4; 5649#ackermannFINAL assume true; 5647#ackermannEXIT >#45#return; 5643#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 5645#$Ultimate##0 ~m := #in~m;~n := #in~n; 5667#L17 assume 0 == ~m;#res := 1 + ~n; 5666#ackermannFINAL assume true; 5642#ackermannEXIT >#47#return; 5641#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 5640#ackermannFINAL assume true; 5636#ackermannEXIT >#43#return; 5638#L21-1 #res := #t~ret4;havoc #t~ret4; 5648#ackermannFINAL assume true; 5646#ackermannEXIT >#45#return; 5571#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 5644#$Ultimate##0 ~m := #in~m;~n := #in~n; 5661#L17 assume !(0 == ~m); 5614#L20 assume 0 == ~n; 5609#L21 call #t~ret4 := ackermann(~m - 1, 1);< 5602#$Ultimate##0 ~m := #in~m;~n := #in~n; 5616#L17 assume !(0 == ~m); 5615#L20 assume !(0 == ~n); 5608#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 5610#$Ultimate##0 ~m := #in~m;~n := #in~n; 5630#L17 assume !(0 == ~m); 5613#L20 assume 0 == ~n; 5609#L21 call #t~ret4 := ackermann(~m - 1, 1);< 5602#$Ultimate##0 ~m := #in~m;~n := #in~n; 5616#L17 assume 0 == ~m;#res := 1 + ~n; 5617#ackermannFINAL assume true; 5632#ackermannEXIT >#43#return; 5633#L21-1 #res := #t~ret4;havoc #t~ret4; 5649#ackermannFINAL assume true; 5647#ackermannEXIT >#45#return; 5643#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 5645#$Ultimate##0 ~m := #in~m;~n := #in~n; 5667#L17 assume 0 == ~m;#res := 1 + ~n; 5666#ackermannFINAL assume true; 5642#ackermannEXIT >#47#return; 5641#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 5640#ackermannFINAL assume true; 5636#ackermannEXIT >#43#return; 5638#L21-1 #res := #t~ret4;havoc #t~ret4; 5648#ackermannFINAL assume true; 5646#ackermannEXIT >#47#return; 5641#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 5640#ackermannFINAL assume true; 5636#ackermannEXIT >#43#return; 5637#L21-1 #res := #t~ret4;havoc #t~ret4; 5670#ackermannFINAL assume true; 5668#ackermannEXIT >#45#return; 5600#L23-1 [2023-02-18 08:55:58,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:55:58,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1100790060, now seen corresponding path program 2 times [2023-02-18 08:55:58,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:55:58,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736874157] [2023-02-18 08:55:58,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:55:58,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:55:58,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:55:58,025 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 08:55:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:55:58,036 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 08:55:58,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:55:58,037 INFO L85 PathProgramCache]: Analyzing trace with hash -119431079, now seen corresponding path program 2 times [2023-02-18 08:55:58,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:55:58,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890842047] [2023-02-18 08:55:58,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:55:58,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:55:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:58,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-18 08:55:58,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:58,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:55:58,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:58,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:55:58,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:58,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:55:58,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:58,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:55:58,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:58,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:55:58,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:58,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:55:58,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:58,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-18 08:55:58,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:58,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:55:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:58,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:55:58,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:58,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:55:58,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:58,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:55:58,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:55:58,470 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 152 proven. 59 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2023-02-18 08:55:58,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:55:58,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890842047] [2023-02-18 08:55:58,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890842047] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 08:55:58,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288551925] [2023-02-18 08:55:58,471 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 08:55:58,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 08:55:58,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:58,477 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 08:55:58,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (135)] Waiting until timeout for monitored process [2023-02-18 08:55:58,543 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 08:55:58,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 08:55:58,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 08:55:58,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:55:58,648 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 90 proven. 84 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2023-02-18 08:55:58,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 08:55:58,989 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 106 proven. 73 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-02-18 08:55:58,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288551925] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 08:55:58,990 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 08:55:58,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 15] total 32 [2023-02-18 08:55:58,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206174199] [2023-02-18 08:55:58,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 08:55:58,991 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-18 08:55:58,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 08:55:58,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-18 08:55:58,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=888, Unknown=0, NotChecked=0, Total=992 [2023-02-18 08:55:58,992 INFO L87 Difference]: Start difference. First operand 107 states and 138 transitions. cyclomatic complexity: 34 Second operand has 32 states, 26 states have (on average 2.0) internal successors, (52), 20 states have internal predecessors, (52), 9 states have call successors, (13), 1 states have call predecessors, (13), 15 states have return successors, (27), 20 states have call predecessors, (27), 9 states have call successors, (27) [2023-02-18 08:55:59,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 08:55:59,692 INFO L93 Difference]: Finished difference Result 148 states and 200 transitions. [2023-02-18 08:55:59,692 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 200 transitions. [2023-02-18 08:55:59,694 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2023-02-18 08:55:59,696 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 147 states and 193 transitions. [2023-02-18 08:55:59,696 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 129 [2023-02-18 08:55:59,697 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2023-02-18 08:55:59,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 147 states and 193 transitions. [2023-02-18 08:55:59,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-18 08:55:59,697 INFO L218 hiAutomatonCegarLoop]: Abstraction has 147 states and 193 transitions. [2023-02-18 08:55:59,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states and 193 transitions. [2023-02-18 08:55:59,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 133. [2023-02-18 08:55:59,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 87 states have (on average 1.0574712643678161) internal successors, (92), 90 states have internal predecessors, (92), 26 states have call successors, (28), 17 states have call predecessors, (28), 20 states have return successors, (55), 25 states have call predecessors, (55), 23 states have call successors, (55) [2023-02-18 08:55:59,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 175 transitions. [2023-02-18 08:55:59,702 INFO L240 hiAutomatonCegarLoop]: Abstraction has 133 states and 175 transitions. [2023-02-18 08:55:59,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-18 08:55:59,703 INFO L428 stractBuchiCegarLoop]: Abstraction has 133 states and 175 transitions. [2023-02-18 08:55:59,703 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-02-18 08:55:59,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 133 states and 175 transitions. [2023-02-18 08:55:59,704 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2023-02-18 08:55:59,704 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-18 08:55:59,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-18 08:55:59,705 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 08:55:59,705 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-18 08:55:59,705 INFO L748 eck$LassoCheckResult]: Stem: 6710#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 6679#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 6676#L29 assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 6677#L33 assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); 6678#L36 call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1);< 6680#$Ultimate##0 ~m := #in~m;~n := #in~n; 6718#L17 assume !(0 == ~m); 6717#L20 assume !(0 == ~n); 6712#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 6713#$Ultimate##0 ~m := #in~m;~n := #in~n; 6725#L17 assume !(0 == ~m); 6726#L20 assume 0 == ~n; 6716#L21 call #t~ret4 := ackermann(~m - 1, 1);< 6749#$Ultimate##0 ~m := #in~m;~n := #in~n; 6784#L17 assume !(0 == ~m); 6715#L20 assume !(0 == ~n); 6700#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 6722#$Ultimate##0 ~m := #in~m;~n := #in~n; 6699#L17 assume !(0 == ~m); 6702#L20 assume 0 == ~n; 6704#L21 call #t~ret4 := ackermann(~m - 1, 1);< 6750#$Ultimate##0 ~m := #in~m;~n := #in~n; 6786#L17 assume 0 == ~m;#res := 1 + ~n; 6785#ackermannFINAL assume true; 6783#ackermannEXIT >#43#return; 6782#L21-1 #res := #t~ret4;havoc #t~ret4; 6781#ackermannFINAL assume true; 6777#ackermannEXIT >#45#return; 6763#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 6764#$Ultimate##0 ~m := #in~m;~n := #in~n; 6770#L17 assume 0 == ~m;#res := 1 + ~n; 6769#ackermannFINAL assume true; 6762#ackermannEXIT >#47#return; 6760#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 6752#ackermannFINAL assume true; 6748#ackermannEXIT >#43#return; 6747#L21-1 #res := #t~ret4;havoc #t~ret4; 6799#ackermannFINAL assume true; 6798#ackermannEXIT >#45#return; 6690#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 6742#$Ultimate##0 [2023-02-18 08:55:59,705 INFO L750 eck$LassoCheckResult]: Loop: 6742#$Ultimate##0 ~m := #in~m;~n := #in~n; 6740#L17 assume !(0 == ~m); 6736#L20 assume !(0 == ~n); 6689#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 6742#$Ultimate##0 [2023-02-18 08:55:59,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:55:59,706 INFO L85 PathProgramCache]: Analyzing trace with hash -235246462, now seen corresponding path program 3 times [2023-02-18 08:55:59,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:55:59,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078944525] [2023-02-18 08:55:59,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:55:59,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:55:59,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:55:59,713 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 08:55:59,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:55:59,721 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 08:55:59,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:55:59,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1697294, now seen corresponding path program 5 times [2023-02-18 08:55:59,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:55:59,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040411409] [2023-02-18 08:55:59,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:55:59,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:55:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:55:59,724 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 08:55:59,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:55:59,726 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 08:55:59,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:55:59,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1578641935, now seen corresponding path program 4 times [2023-02-18 08:55:59,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:55:59,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985738306] [2023-02-18 08:55:59,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:55:59,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:55:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:55:59,733 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 08:55:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:55:59,742 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 08:55:59,744 INFO L210 LassoAnalysis]: Preferences: [2023-02-18 08:55:59,744 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-18 08:55:59,744 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-18 08:55:59,744 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-18 08:55:59,745 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-18 08:55:59,745 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:59,745 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-18 08:55:59,745 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-18 08:55:59,745 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration11_Loop [2023-02-18 08:55:59,745 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-18 08:55:59,745 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-18 08:55:59,746 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:59,746 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:59,747 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:59,748 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:59,748 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:59,759 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:59,760 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:59,760 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:59,762 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-18 08:55:59,762 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-18 08:55:59,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:59,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:59,769 INFO L229 MonitoredProcess]: Starting monitored process 136 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) [2023-02-18 08:55:59,773 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:59,774 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:59,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2023-02-18 08:55:59,783 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:59,783 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret5=0} Honda state: {ackermann_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-18 08:55:59,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:59,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:59,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:59,788 INFO L229 MonitoredProcess]: Starting monitored process 137 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) [2023-02-18 08:55:59,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2023-02-18 08:55:59,791 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:59,791 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:59,813 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:59,813 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~m=4} Honda state: {ackermann_#in~m=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-18 08:55:59,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:59,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:59,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:59,819 INFO L229 MonitoredProcess]: Starting monitored process 138 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) [2023-02-18 08:55:59,831 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:59,831 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:59,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2023-02-18 08:55:59,841 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:59,841 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-18 08:55:59,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:59,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:59,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:59,845 INFO L229 MonitoredProcess]: Starting monitored process 139 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) [2023-02-18 08:55:59,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2023-02-18 08:55:59,848 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:59,848 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:59,855 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:59,855 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~m=0} Honda state: {ackermann_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-18 08:55:59,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0 [2023-02-18 08:55:59,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:59,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:59,859 INFO L229 MonitoredProcess]: Starting monitored process 140 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) [2023-02-18 08:55:59,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2023-02-18 08:55:59,863 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:59,863 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:59,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0 [2023-02-18 08:55:59,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:59,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:59,873 INFO L229 MonitoredProcess]: Starting monitored process 141 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) [2023-02-18 08:55:59,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2023-02-18 08:55:59,876 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-18 08:55:59,876 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:59,896 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:59,896 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~n=-8} Honda state: {ackermann_#in~n=-8} Generalized eigenvectors: [{ackermann_#in~n=0}, {ackermann_#in~n=0}, {ackermann_#in~n=-1}] Lambdas: [2, 8, 1] Nus: [0, 0] [2023-02-18 08:55:59,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:59,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:59,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:59,901 INFO L229 MonitoredProcess]: Starting monitored process 142 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) [2023-02-18 08:55:59,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2023-02-18 08:55:59,905 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:59,905 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:59,912 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:59,912 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=0} Honda state: {ackermann_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-18 08:55:59,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Ended with exit code 0 [2023-02-18 08:55:59,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:59,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:59,916 INFO L229 MonitoredProcess]: Starting monitored process 143 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) [2023-02-18 08:55:59,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2023-02-18 08:55:59,919 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:59,919 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:59,926 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:59,926 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret4=0} Honda state: {ackermann_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-18 08:55:59,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Ended with exit code 0 [2023-02-18 08:55:59,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:59,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:55:59,930 INFO L229 MonitoredProcess]: Starting monitored process 144 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) [2023-02-18 08:55:59,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2023-02-18 08:55:59,933 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:55:59,933 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:55:59,940 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:55:59,940 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret6=0} Honda state: {ackermann_#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-18 08:55:59,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Forceful destruction successful, exit code 0 [2023-02-18 08:55:59,957 INFO L210 LassoAnalysis]: Preferences: [2023-02-18 08:55:59,958 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-18 08:55:59,958 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-18 08:55:59,958 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-18 08:55:59,958 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-18 08:55:59,958 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:55:59,958 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-18 08:55:59,958 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-18 08:55:59,958 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann01-1.c_Iteration11_Lasso [2023-02-18 08:55:59,958 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-18 08:55:59,958 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-18 08:55:59,959 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:59,963 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:59,964 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:59,967 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:59,968 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:59,968 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:59,969 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:59,970 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:59,970 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:59,971 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:59,972 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:59,972 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:59,973 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:59,973 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:59,974 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:59,975 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:59,976 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:59,976 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:59,986 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:59,987 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:59,988 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:59,994 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:55:59,995 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:56:00,000 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-18 08:56:00,000 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-18 08:56:00,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:56:00,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:56:00,002 INFO L229 MonitoredProcess]: Starting monitored process 145 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) [2023-02-18 08:56:00,012 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:56:00,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:56:00,020 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:56:00,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:56:00,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:56:00,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:56:00,021 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:56:00,021 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:56:00,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2023-02-18 08:56:00,030 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:56:00,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Forceful destruction successful, exit code 0 [2023-02-18 08:56:00,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:56:00,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:56:00,035 INFO L229 MonitoredProcess]: Starting monitored process 146 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) [2023-02-18 08:56:00,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2023-02-18 08:56:00,039 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:56:00,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:56:00,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:56:00,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:56:00,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:56:00,048 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-18 08:56:00,048 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-18 08:56:00,062 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:56:00,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Forceful destruction successful, exit code 0 [2023-02-18 08:56:00,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:56:00,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:56:00,068 INFO L229 MonitoredProcess]: Starting monitored process 147 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) [2023-02-18 08:56:00,073 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:56:00,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:56:00,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:56:00,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:56:00,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:56:00,082 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-18 08:56:00,082 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-18 08:56:00,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2023-02-18 08:56:00,093 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:56:00,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Forceful destruction successful, exit code 0 [2023-02-18 08:56:00,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:56:00,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:56:00,100 INFO L229 MonitoredProcess]: Starting monitored process 148 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) [2023-02-18 08:56:00,105 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:56:00,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:56:00,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:56:00,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:56:00,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:56:00,114 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-18 08:56:00,114 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-18 08:56:00,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2023-02-18 08:56:00,125 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:56:00,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Forceful destruction successful, exit code 0 [2023-02-18 08:56:00,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:56:00,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:56:00,132 INFO L229 MonitoredProcess]: Starting monitored process 149 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) [2023-02-18 08:56:00,137 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:56:00,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2023-02-18 08:56:00,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:56:00,143 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:56:00,144 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:56:00,144 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:56:00,144 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:56:00,144 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:56:00,144 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:56:00,157 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:56:00,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Ended with exit code 0 [2023-02-18 08:56:00,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:56:00,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:56:00,161 INFO L229 MonitoredProcess]: Starting monitored process 150 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) [2023-02-18 08:56:00,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2023-02-18 08:56:00,165 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:56:00,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:56:00,171 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:56:00,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:56:00,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:56:00,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:56:00,172 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:56:00,172 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:56:00,173 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:56:00,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Ended with exit code 0 [2023-02-18 08:56:00,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:56:00,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:56:00,177 INFO L229 MonitoredProcess]: Starting monitored process 151 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) [2023-02-18 08:56:00,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2023-02-18 08:56:00,181 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:56:00,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:56:00,187 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:56:00,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:56:00,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:56:00,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:56:00,188 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:56:00,188 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:56:00,189 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:56:00,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Ended with exit code 0 [2023-02-18 08:56:00,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:56:00,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:56:00,192 INFO L229 MonitoredProcess]: Starting monitored process 152 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) [2023-02-18 08:56:00,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2023-02-18 08:56:00,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:56:00,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:56:00,202 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:56:00,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:56:00,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:56:00,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:56:00,202 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:56:00,202 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:56:00,215 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:56:00,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Ended with exit code 0 [2023-02-18 08:56:00,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:56:00,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:56:00,225 INFO L229 MonitoredProcess]: Starting monitored process 153 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) [2023-02-18 08:56:00,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2023-02-18 08:56:00,226 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:56:00,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:56:00,232 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:56:00,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:56:00,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:56:00,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:56:00,232 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:56:00,232 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:56:00,233 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:56:00,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Ended with exit code 0 [2023-02-18 08:56:00,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:56:00,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:56:00,237 INFO L229 MonitoredProcess]: Starting monitored process 154 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) [2023-02-18 08:56:00,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2023-02-18 08:56:00,240 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-18 08:56:00,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:56:00,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:56:00,247 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-02-18 08:56:00,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:56:00,250 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-02-18 08:56:00,250 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-02-18 08:56:00,260 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-18 08:56:00,273 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2023-02-18 08:56:00,273 INFO L444 ModelExtractionUtils]: 1 out of 11 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-02-18 08:56:00,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:56:00,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:56:00,275 INFO L229 MonitoredProcess]: Starting monitored process 155 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) [2023-02-18 08:56:00,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2023-02-18 08:56:00,278 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-18 08:56:00,286 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2023-02-18 08:56:00,286 INFO L513 LassoAnalysis]: Proved termination. [2023-02-18 08:56:00,286 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ackermann_#in~n) = 1*ackermann_#in~n Supporting invariants [1*ackermann_#in~n >= 0] [2023-02-18 08:56:00,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Forceful destruction successful, exit code 0 [2023-02-18 08:56:00,292 INFO L156 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2023-02-18 08:56:00,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:56:00,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:00,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-18 08:56:00,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:56:00,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:00,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 08:56:00,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:56:00,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Forceful destruction successful, exit code 0 [2023-02-18 08:56:00,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 08:56:00,534 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.11 stem predicates 3 loop predicates [2023-02-18 08:56:00,534 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 133 states and 175 transitions. cyclomatic complexity: 46 Second operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-18 08:56:00,722 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 133 states and 175 transitions. cyclomatic complexity: 46. Second operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Result 137 states and 184 transitions. Complement of second has 13 states. [2023-02-18 08:56:00,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 7 stem states 1 non-accepting loop states 1 accepting loop states [2023-02-18 08:56:00,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-18 08:56:00,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 21 transitions. [2023-02-18 08:56:00,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 21 transitions. Stem has 40 letters. Loop has 4 letters. [2023-02-18 08:56:00,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:56:00,725 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-18 08:56:00,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:56:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:00,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-18 08:56:00,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:56:00,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:00,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 08:56:00,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:56:00,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 08:56:00,942 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.11 stem predicates 3 loop predicates [2023-02-18 08:56:00,942 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 133 states and 175 transitions. cyclomatic complexity: 46 Second operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-18 08:56:01,135 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 133 states and 175 transitions. cyclomatic complexity: 46. Second operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Result 137 states and 184 transitions. Complement of second has 13 states. [2023-02-18 08:56:01,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 7 stem states 1 non-accepting loop states 1 accepting loop states [2023-02-18 08:56:01,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-18 08:56:01,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 21 transitions. [2023-02-18 08:56:01,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 21 transitions. Stem has 40 letters. Loop has 4 letters. [2023-02-18 08:56:01,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:56:01,136 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-18 08:56:01,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:56:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:01,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-18 08:56:01,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:56:01,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:01,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 08:56:01,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:56:01,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 08:56:01,375 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.11 stem predicates 3 loop predicates [2023-02-18 08:56:01,375 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 133 states and 175 transitions. cyclomatic complexity: 46 Second operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-18 08:56:01,766 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 133 states and 175 transitions. cyclomatic complexity: 46. Second operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Result 218 states and 282 transitions. Complement of second has 42 states. [2023-02-18 08:56:01,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 12 stem states 2 non-accepting loop states 1 accepting loop states [2023-02-18 08:56:01,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-18 08:56:01,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 37 transitions. [2023-02-18 08:56:01,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 37 transitions. Stem has 40 letters. Loop has 4 letters. [2023-02-18 08:56:01,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:56:01,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 37 transitions. Stem has 44 letters. Loop has 4 letters. [2023-02-18 08:56:01,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:56:01,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 37 transitions. Stem has 40 letters. Loop has 8 letters. [2023-02-18 08:56:01,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:56:01,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 218 states and 282 transitions. [2023-02-18 08:56:01,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2023-02-18 08:56:01,773 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 218 states to 174 states and 228 transitions. [2023-02-18 08:56:01,773 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 127 [2023-02-18 08:56:01,774 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 135 [2023-02-18 08:56:01,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 228 transitions. [2023-02-18 08:56:01,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-18 08:56:01,774 INFO L218 hiAutomatonCegarLoop]: Abstraction has 174 states and 228 transitions. [2023-02-18 08:56:01,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 228 transitions. [2023-02-18 08:56:01,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 152. [2023-02-18 08:56:01,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 100 states have (on average 1.06) internal successors, (106), 101 states have internal predecessors, (106), 33 states have call successors, (36), 19 states have call predecessors, (36), 19 states have return successors, (49), 31 states have call predecessors, (49), 29 states have call successors, (49) [2023-02-18 08:56:01,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 191 transitions. [2023-02-18 08:56:01,779 INFO L240 hiAutomatonCegarLoop]: Abstraction has 152 states and 191 transitions. [2023-02-18 08:56:01,779 INFO L428 stractBuchiCegarLoop]: Abstraction has 152 states and 191 transitions. [2023-02-18 08:56:01,779 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-02-18 08:56:01,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 152 states and 191 transitions. [2023-02-18 08:56:01,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2023-02-18 08:56:01,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-18 08:56:01,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-18 08:56:01,781 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [13, 11, 9, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2023-02-18 08:56:01,781 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [13, 11, 9, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3] [2023-02-18 08:56:01,782 INFO L748 eck$LassoCheckResult]: Stem: 7923#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 7889#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 7886#L29 assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 7887#L33 assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); 7888#L36 call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1);< 7890#$Ultimate##0 ~m := #in~m;~n := #in~n; 7952#L17 assume !(0 == ~m); 7950#L20 assume !(0 == ~n); 7945#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 7948#$Ultimate##0 ~m := #in~m;~n := #in~n; 7951#L17 assume !(0 == ~m); 7949#L20 assume !(0 == ~n); 7944#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 7943#$Ultimate##0 ~m := #in~m;~n := #in~n; 7946#L17 assume !(0 == ~m); 7971#L20 assume 0 == ~n; 7940#L21 call #t~ret4 := ackermann(~m - 1, 1);< 7947#$Ultimate##0 ~m := #in~m;~n := #in~n; 7942#L17 assume !(0 == ~m); 7939#L20 assume !(0 == ~n); 7930#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 7936#$Ultimate##0 ~m := #in~m;~n := #in~n; 7934#L17 assume !(0 == ~m); 7929#L20 assume 0 == ~n; 7932#L21 call #t~ret4 := ackermann(~m - 1, 1);< 7947#$Ultimate##0 ~m := #in~m;~n := #in~n; 7942#L17 assume !(0 == ~m); 7939#L20 assume !(0 == ~n); 7930#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 7936#$Ultimate##0 ~m := #in~m;~n := #in~n; 7934#L17 assume !(0 == ~m); 7929#L20 assume 0 == ~n; 7932#L21 call #t~ret4 := ackermann(~m - 1, 1);< 7970#$Ultimate##0 ~m := #in~m;~n := #in~n; 7999#L17 assume 0 == ~m;#res := 1 + ~n; 7998#ackermannFINAL assume true; 7997#ackermannEXIT >#43#return; 7996#L21-1 #res := #t~ret4;havoc #t~ret4; 7995#ackermannFINAL assume true; 7994#ackermannEXIT >#45#return; 7979#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 7980#$Ultimate##0 ~m := #in~m;~n := #in~n; 7982#L17 assume 0 == ~m;#res := 1 + ~n; 7981#ackermannFINAL assume true; 7978#ackermannEXIT >#47#return; 7976#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 7974#ackermannFINAL assume true; 7969#ackermannEXIT >#43#return; 7966#L21-1 #res := #t~ret4;havoc #t~ret4; 7963#ackermannFINAL assume true; 7961#ackermannEXIT >#45#return; 7957#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 7958#$Ultimate##0 ~m := #in~m;~n := #in~n; 8029#L17 assume !(0 == ~m); 8028#L20 assume !(0 == ~n); 7883#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 7937#$Ultimate##0 ~m := #in~m;~n := #in~n; 7935#L17 assume !(0 == ~m); 7933#L20 assume 0 == ~n; 7913#L21 call #t~ret4 := ackermann(~m - 1, 1);< 7914#$Ultimate##0 ~m := #in~m;~n := #in~n; 7993#L17 assume 0 == ~m;#res := 1 + ~n; 7926#ackermannFINAL assume true; 7992#ackermannEXIT >#43#return; 7917#L21-1 #res := #t~ret4;havoc #t~ret4; 7878#ackermannFINAL assume true; 7885#ackermannEXIT >#45#return; 7892#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 7891#$Ultimate##0 ~m := #in~m;~n := #in~n; 7895#L17 assume 0 == ~m;#res := 1 + ~n; 7906#ackermannFINAL assume true; 8027#ackermannEXIT >#47#return; 8020#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 8018#ackermannFINAL assume true; 8016#ackermannEXIT >#47#return; 8015#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 8014#ackermannFINAL assume true; 8012#ackermannEXIT >#43#return; 8013#L21-1 #res := #t~ret4;havoc #t~ret4; 8026#ackermannFINAL assume true; 8007#ackermannEXIT >#45#return; 7903#L23-1 [2023-02-18 08:56:01,782 INFO L750 eck$LassoCheckResult]: Loop: 7903#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 7960#$Ultimate##0 ~m := #in~m;~n := #in~n; 8024#L17 assume !(0 == ~m); 8023#L20 assume !(0 == ~n); 7880#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 7896#$Ultimate##0 ~m := #in~m;~n := #in~n; 7897#L17 assume !(0 == ~m); 8006#L20 assume !(0 == ~n); 7884#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 7896#$Ultimate##0 ~m := #in~m;~n := #in~n; 7898#L17 assume !(0 == ~m); 7973#L20 assume 0 == ~n; 7920#L21 call #t~ret4 := ackermann(~m - 1, 1);< 7927#$Ultimate##0 ~m := #in~m;~n := #in~n; 7925#L17 assume !(0 == ~m); 7924#L20 assume !(0 == ~n); 7919#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 7922#$Ultimate##0 ~m := #in~m;~n := #in~n; 7977#L17 assume !(0 == ~m); 7975#L20 assume 0 == ~n; 7921#L21 call #t~ret4 := ackermann(~m - 1, 1);< 7927#$Ultimate##0 ~m := #in~m;~n := #in~n; 7925#L17 assume !(0 == ~m); 7924#L20 assume !(0 == ~n); 7919#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 7922#$Ultimate##0 ~m := #in~m;~n := #in~n; 7977#L17 assume !(0 == ~m); 7975#L20 assume 0 == ~n; 7921#L21 call #t~ret4 := ackermann(~m - 1, 1);< 7927#$Ultimate##0 ~m := #in~m;~n := #in~n; 7925#L17 assume 0 == ~m;#res := 1 + ~n; 7926#ackermannFINAL assume true; 7992#ackermannEXIT >#43#return; 7991#L21-1 #res := #t~ret4;havoc #t~ret4; 7990#ackermannFINAL assume true; 7988#ackermannEXIT >#45#return; 7985#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 7986#$Ultimate##0 ~m := #in~m;~n := #in~n; 7989#L17 assume 0 == ~m;#res := 1 + ~n; 7987#ackermannFINAL assume true; 7984#ackermannEXIT >#47#return; 7983#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 7972#ackermannFINAL assume true; 7967#ackermannEXIT >#43#return; 7966#L21-1 #res := #t~ret4;havoc #t~ret4; 7963#ackermannFINAL assume true; 7961#ackermannEXIT >#45#return; 7957#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 7958#$Ultimate##0 ~m := #in~m;~n := #in~n; 8029#L17 assume !(0 == ~m); 8028#L20 assume !(0 == ~n); 7883#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 7937#$Ultimate##0 ~m := #in~m;~n := #in~n; 7935#L17 assume !(0 == ~m); 7933#L20 assume 0 == ~n; 7913#L21 call #t~ret4 := ackermann(~m - 1, 1);< 7914#$Ultimate##0 ~m := #in~m;~n := #in~n; 7993#L17 assume 0 == ~m;#res := 1 + ~n; 7926#ackermannFINAL assume true; 7992#ackermannEXIT >#43#return; 7917#L21-1 #res := #t~ret4;havoc #t~ret4; 7878#ackermannFINAL assume true; 7885#ackermannEXIT >#45#return; 7892#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 7891#$Ultimate##0 ~m := #in~m;~n := #in~n; 7895#L17 assume 0 == ~m;#res := 1 + ~n; 7906#ackermannFINAL assume true; 8027#ackermannEXIT >#47#return; 8020#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 8018#ackermannFINAL assume true; 8016#ackermannEXIT >#47#return; 8015#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 8014#ackermannFINAL assume true; 8012#ackermannEXIT >#43#return; 8013#L21-1 #res := #t~ret4;havoc #t~ret4; 8026#ackermannFINAL assume true; 8007#ackermannEXIT >#45#return; 7903#L23-1 [2023-02-18 08:56:01,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:56:01,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1984234175, now seen corresponding path program 5 times [2023-02-18 08:56:01,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:56:01,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129032063] [2023-02-18 08:56:01,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:56:01,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:56:01,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:01,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-18 08:56:01,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:01,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:01,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:01,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:01,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:02,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:02,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:02,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:02,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:02,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:02,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:02,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-18 08:56:02,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:02,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:02,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:02,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:02,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:02,137 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 115 proven. 61 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2023-02-18 08:56:02,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:56:02,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129032063] [2023-02-18 08:56:02,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129032063] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 08:56:02,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527793342] [2023-02-18 08:56:02,137 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-18 08:56:02,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 08:56:02,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:56:02,139 INFO L229 MonitoredProcess]: Starting monitored process 156 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 08:56:02,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (156)] Waiting until timeout for monitored process [2023-02-18 08:56:02,242 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2023-02-18 08:56:02,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 08:56:02,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-18 08:56:02,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:56:02,302 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 102 proven. 69 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2023-02-18 08:56:02,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 08:56:02,583 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 120 proven. 59 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2023-02-18 08:56:02,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527793342] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 08:56:02,583 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 08:56:02,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 16] total 26 [2023-02-18 08:56:02,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678120438] [2023-02-18 08:56:02,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 08:56:02,584 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-18 08:56:02,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:56:02,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1263997516, now seen corresponding path program 3 times [2023-02-18 08:56:02,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:56:02,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923193811] [2023-02-18 08:56:02,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:56:02,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:56:02,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:02,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-18 08:56:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:02,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:02,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:02,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:02,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:02,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:02,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:02,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:02,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:02,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:02,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:02,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:02,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-18 08:56:02,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:02,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:02,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:02,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:02,933 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 118 proven. 61 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2023-02-18 08:56:02,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:56:02,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923193811] [2023-02-18 08:56:02,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923193811] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 08:56:02,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017650395] [2023-02-18 08:56:02,934 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 08:56:02,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 08:56:02,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:56:02,935 INFO L229 MonitoredProcess]: Starting monitored process 157 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 08:56:02,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (157)] Waiting until timeout for monitored process [2023-02-18 08:56:03,044 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2023-02-18 08:56:03,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 08:56:03,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-18 08:56:03,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:56:03,097 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 105 proven. 69 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2023-02-18 08:56:03,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 08:56:03,379 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 123 proven. 59 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2023-02-18 08:56:03,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017650395] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 08:56:03,379 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 08:56:03,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 16] total 26 [2023-02-18 08:56:03,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071536560] [2023-02-18 08:56:03,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 08:56:03,380 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-18 08:56:03,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 08:56:03,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-18 08:56:03,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2023-02-18 08:56:03,382 INFO L87 Difference]: Start difference. First operand 152 states and 191 transitions. cyclomatic complexity: 43 Second operand has 26 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 18 states have internal predecessors, (48), 10 states have call successors, (12), 1 states have call predecessors, (12), 12 states have return successors, (20), 12 states have call predecessors, (20), 10 states have call successors, (20) [2023-02-18 08:56:03,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 08:56:03,751 INFO L93 Difference]: Finished difference Result 189 states and 258 transitions. [2023-02-18 08:56:03,751 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 189 states and 258 transitions. [2023-02-18 08:56:03,753 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2023-02-18 08:56:03,755 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 189 states to 173 states and 232 transitions. [2023-02-18 08:56:03,755 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 134 [2023-02-18 08:56:03,756 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 134 [2023-02-18 08:56:03,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 173 states and 232 transitions. [2023-02-18 08:56:03,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-18 08:56:03,756 INFO L218 hiAutomatonCegarLoop]: Abstraction has 173 states and 232 transitions. [2023-02-18 08:56:03,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states and 232 transitions. [2023-02-18 08:56:03,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 158. [2023-02-18 08:56:03,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 103 states have (on average 1.058252427184466) internal successors, (109), 107 states have internal predecessors, (109), 33 states have call successors, (36), 19 states have call predecessors, (36), 22 states have return successors, (57), 31 states have call predecessors, (57), 29 states have call successors, (57) [2023-02-18 08:56:03,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 202 transitions. [2023-02-18 08:56:03,762 INFO L240 hiAutomatonCegarLoop]: Abstraction has 158 states and 202 transitions. [2023-02-18 08:56:03,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-18 08:56:03,763 INFO L428 stractBuchiCegarLoop]: Abstraction has 158 states and 202 transitions. [2023-02-18 08:56:03,763 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-02-18 08:56:03,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 158 states and 202 transitions. [2023-02-18 08:56:03,765 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2023-02-18 08:56:03,765 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-18 08:56:03,765 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-18 08:56:03,766 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [14, 13, 9, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2023-02-18 08:56:03,766 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [14, 13, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4] [2023-02-18 08:56:03,766 INFO L748 eck$LassoCheckResult]: Stem: 9773#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 9744#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 9741#L29 assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 9742#L33 assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); 9743#L36 call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1);< 9745#$Ultimate##0 ~m := #in~m;~n := #in~n; 9809#L17 assume !(0 == ~m); 9807#L20 assume !(0 == ~n); 9737#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 9799#$Ultimate##0 ~m := #in~m;~n := #in~n; 9800#L17 assume !(0 == ~m); 9788#L20 assume 0 == ~n; 9789#L21 call #t~ret4 := ackermann(~m - 1, 1);< 9804#$Ultimate##0 ~m := #in~m;~n := #in~n; 9805#L17 assume !(0 == ~m); 9798#L20 assume !(0 == ~n); 9786#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 9793#$Ultimate##0 ~m := #in~m;~n := #in~n; 9791#L17 assume !(0 == ~m); 9784#L20 assume 0 == ~n; 9787#L21 call #t~ret4 := ackermann(~m - 1, 1);< 9804#$Ultimate##0 ~m := #in~m;~n := #in~n; 9805#L17 assume !(0 == ~m); 9798#L20 assume !(0 == ~n); 9786#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 9793#$Ultimate##0 ~m := #in~m;~n := #in~n; 9791#L17 assume !(0 == ~m); 9784#L20 assume 0 == ~n; 9787#L21 call #t~ret4 := ackermann(~m - 1, 1);< 9826#$Ultimate##0 ~m := #in~m;~n := #in~n; 9852#L17 assume 0 == ~m;#res := 1 + ~n; 9851#ackermannFINAL assume true; 9848#ackermannEXIT >#43#return; 9847#L21-1 #res := #t~ret4;havoc #t~ret4; 9846#ackermannFINAL assume true; 9845#ackermannEXIT >#45#return; 9843#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 9844#$Ultimate##0 ~m := #in~m;~n := #in~n; 9850#L17 assume 0 == ~m;#res := 1 + ~n; 9849#ackermannFINAL assume true; 9842#ackermannEXIT >#47#return; 9839#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 9836#ackermannFINAL assume true; 9825#ackermannEXIT >#43#return; 9822#L21-1 #res := #t~ret4;havoc #t~ret4; 9821#ackermannFINAL assume true; 9818#ackermannEXIT >#45#return; 9811#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 9813#$Ultimate##0 ~m := #in~m;~n := #in~n; 9812#L17 assume !(0 == ~m); 9810#L20 assume !(0 == ~n); 9759#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 9794#$Ultimate##0 ~m := #in~m;~n := #in~n; 9795#L17 assume !(0 == ~m); 9888#L20 assume !(0 == ~n); 9757#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 9794#$Ultimate##0 ~m := #in~m;~n := #in~n; 9792#L17 assume !(0 == ~m); 9790#L20 assume 0 == ~n; 9766#L21 call #t~ret4 := ackermann(~m - 1, 1);< 9767#$Ultimate##0 ~m := #in~m;~n := #in~n; 9853#L17 assume 0 == ~m;#res := 1 + ~n; 9780#ackermannFINAL assume true; 9841#ackermannEXIT >#43#return; 9771#L21-1 #res := #t~ret4;havoc #t~ret4; 9772#ackermannFINAL assume true; 9889#ackermannEXIT >#45#return; 9747#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 9746#$Ultimate##0 ~m := #in~m;~n := #in~n; 9750#L17 assume 0 == ~m;#res := 1 + ~n; 9760#ackermannFINAL assume true; 9866#ackermannEXIT >#47#return; 9867#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 9891#ackermannFINAL assume true; 9869#ackermannEXIT >#45#return; 9748#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 9746#$Ultimate##0 ~m := #in~m;~n := #in~n; 9750#L17 assume 0 == ~m;#res := 1 + ~n; 9760#ackermannFINAL assume true; 9866#ackermannEXIT >#47#return; 9868#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 9883#ackermannFINAL assume true; 9881#ackermannEXIT >#47#return; 9880#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 9879#ackermannFINAL assume true; 9877#ackermannEXIT >#43#return; 9878#L21-1 #res := #t~ret4;havoc #t~ret4; 9890#ackermannFINAL assume true; 9754#ackermannEXIT >#45#return; 9756#L23-1 [2023-02-18 08:56:03,766 INFO L750 eck$LassoCheckResult]: Loop: 9756#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 9816#$Ultimate##0 ~m := #in~m;~n := #in~n; 9873#L17 assume !(0 == ~m); 9871#L20 assume !(0 == ~n); 9739#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 9751#$Ultimate##0 ~m := #in~m;~n := #in~n; 9753#L17 assume !(0 == ~m); 9764#L20 assume 0 == ~n; 9765#L21 call #t~ret4 := ackermann(~m - 1, 1);< 9781#$Ultimate##0 ~m := #in~m;~n := #in~n; 9779#L17 assume !(0 == ~m); 9778#L20 assume !(0 == ~n); 9774#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 9777#$Ultimate##0 ~m := #in~m;~n := #in~n; 9817#L17 assume !(0 == ~m); 9827#L20 assume 0 == ~n; 9776#L21 call #t~ret4 := ackermann(~m - 1, 1);< 9781#$Ultimate##0 ~m := #in~m;~n := #in~n; 9779#L17 assume !(0 == ~m); 9778#L20 assume !(0 == ~n); 9774#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 9777#$Ultimate##0 ~m := #in~m;~n := #in~n; 9817#L17 assume !(0 == ~m); 9827#L20 assume 0 == ~n; 9776#L21 call #t~ret4 := ackermann(~m - 1, 1);< 9781#$Ultimate##0 ~m := #in~m;~n := #in~n; 9779#L17 assume 0 == ~m;#res := 1 + ~n; 9780#ackermannFINAL assume true; 9841#ackermannEXIT >#43#return; 9838#L21-1 #res := #t~ret4;havoc #t~ret4; 9835#ackermannFINAL assume true; 9834#ackermannEXIT >#45#return; 9832#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 9833#$Ultimate##0 ~m := #in~m;~n := #in~n; 9840#L17 assume 0 == ~m;#res := 1 + ~n; 9837#ackermannFINAL assume true; 9831#ackermannEXIT >#47#return; 9829#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 9828#ackermannFINAL assume true; 9823#ackermannEXIT >#43#return; 9822#L21-1 #res := #t~ret4;havoc #t~ret4; 9821#ackermannFINAL assume true; 9818#ackermannEXIT >#45#return; 9811#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 9813#$Ultimate##0 ~m := #in~m;~n := #in~n; 9812#L17 assume !(0 == ~m); 9810#L20 assume !(0 == ~n); 9759#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 9794#$Ultimate##0 ~m := #in~m;~n := #in~n; 9795#L17 assume !(0 == ~m); 9888#L20 assume !(0 == ~n); 9757#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 9794#$Ultimate##0 ~m := #in~m;~n := #in~n; 9792#L17 assume !(0 == ~m); 9790#L20 assume 0 == ~n; 9766#L21 call #t~ret4 := ackermann(~m - 1, 1);< 9767#$Ultimate##0 ~m := #in~m;~n := #in~n; 9853#L17 assume 0 == ~m;#res := 1 + ~n; 9780#ackermannFINAL assume true; 9841#ackermannEXIT >#43#return; 9771#L21-1 #res := #t~ret4;havoc #t~ret4; 9772#ackermannFINAL assume true; 9889#ackermannEXIT >#45#return; 9747#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 9746#$Ultimate##0 ~m := #in~m;~n := #in~n; 9750#L17 assume 0 == ~m;#res := 1 + ~n; 9760#ackermannFINAL assume true; 9866#ackermannEXIT >#47#return; 9867#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 9891#ackermannFINAL assume true; 9869#ackermannEXIT >#45#return; 9748#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 9746#$Ultimate##0 ~m := #in~m;~n := #in~n; 9750#L17 assume 0 == ~m;#res := 1 + ~n; 9760#ackermannFINAL assume true; 9866#ackermannEXIT >#47#return; 9868#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 9883#ackermannFINAL assume true; 9881#ackermannEXIT >#47#return; 9880#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 9879#ackermannFINAL assume true; 9877#ackermannEXIT >#43#return; 9878#L21-1 #res := #t~ret4;havoc #t~ret4; 9890#ackermannFINAL assume true; 9754#ackermannEXIT >#45#return; 9756#L23-1 [2023-02-18 08:56:03,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:56:03,767 INFO L85 PathProgramCache]: Analyzing trace with hash 2095171192, now seen corresponding path program 6 times [2023-02-18 08:56:03,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:56:03,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307518464] [2023-02-18 08:56:03,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:56:03,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:56:03,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:03,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-18 08:56:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:03,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:03,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:04,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:04,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:04,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:04,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:04,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:04,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:04,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:04,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:04,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:04,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:04,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-18 08:56:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:04,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:04,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:04,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:04,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:04,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:04,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:04,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:04,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:04,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:56:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:04,192 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 139 proven. 101 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2023-02-18 08:56:04,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:56:04,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307518464] [2023-02-18 08:56:04,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307518464] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 08:56:04,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044745754] [2023-02-18 08:56:04,192 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-18 08:56:04,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 08:56:04,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:56:04,201 INFO L229 MonitoredProcess]: Starting monitored process 158 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 08:56:04,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (158)] Waiting until timeout for monitored process [2023-02-18 08:56:04,338 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2023-02-18 08:56:04,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 08:56:04,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-18 08:56:04,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:56:04,390 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 125 proven. 109 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2023-02-18 08:56:04,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 08:56:04,687 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 141 proven. 107 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2023-02-18 08:56:04,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044745754] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 08:56:04,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 08:56:04,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 17] total 23 [2023-02-18 08:56:04,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283811167] [2023-02-18 08:56:04,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 08:56:04,689 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-18 08:56:04,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:56:04,690 INFO L85 PathProgramCache]: Analyzing trace with hash -869926651, now seen corresponding path program 4 times [2023-02-18 08:56:04,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:56:04,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650264524] [2023-02-18 08:56:04,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:56:04,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:56:04,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:04,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-18 08:56:04,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:04,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:04,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:04,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:04,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:04,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:04,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:04,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:04,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:05,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:05,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-18 08:56:05,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:05,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:05,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:05,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:05,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:05,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:05,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:05,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:05,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:05,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:56:05,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:05,108 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 143 proven. 101 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2023-02-18 08:56:05,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:56:05,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650264524] [2023-02-18 08:56:05,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650264524] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 08:56:05,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966930614] [2023-02-18 08:56:05,109 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-18 08:56:05,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 08:56:05,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:56:05,113 INFO L229 MonitoredProcess]: Starting monitored process 159 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 08:56:05,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (159)] Waiting until timeout for monitored process [2023-02-18 08:56:05,276 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-18 08:56:05,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 08:56:05,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-18 08:56:05,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:56:05,355 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 129 proven. 109 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2023-02-18 08:56:05,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 08:56:05,597 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 145 proven. 107 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2023-02-18 08:56:05,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966930614] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 08:56:05,597 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 08:56:05,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 17] total 23 [2023-02-18 08:56:05,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055424857] [2023-02-18 08:56:05,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 08:56:05,598 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-18 08:56:05,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 08:56:05,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-18 08:56:05,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2023-02-18 08:56:05,599 INFO L87 Difference]: Start difference. First operand 158 states and 202 transitions. cyclomatic complexity: 48 Second operand has 23 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 18 states have internal predecessors, (49), 11 states have call successors, (13), 1 states have call predecessors, (13), 12 states have return successors, (21), 10 states have call predecessors, (21), 11 states have call successors, (21) [2023-02-18 08:56:05,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 08:56:05,955 INFO L93 Difference]: Finished difference Result 202 states and 280 transitions. [2023-02-18 08:56:05,955 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 202 states and 280 transitions. [2023-02-18 08:56:05,958 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2023-02-18 08:56:05,960 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 202 states to 186 states and 254 transitions. [2023-02-18 08:56:05,960 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 147 [2023-02-18 08:56:05,960 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 147 [2023-02-18 08:56:05,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 186 states and 254 transitions. [2023-02-18 08:56:05,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-18 08:56:05,961 INFO L218 hiAutomatonCegarLoop]: Abstraction has 186 states and 254 transitions. [2023-02-18 08:56:05,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states and 254 transitions. [2023-02-18 08:56:05,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 170. [2023-02-18 08:56:05,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 109 states have (on average 1.055045871559633) internal successors, (115), 113 states have internal predecessors, (115), 36 states have call successors, (39), 19 states have call predecessors, (39), 25 states have return successors, (69), 37 states have call predecessors, (69), 32 states have call successors, (69) [2023-02-18 08:56:05,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 223 transitions. [2023-02-18 08:56:05,967 INFO L240 hiAutomatonCegarLoop]: Abstraction has 170 states and 223 transitions. [2023-02-18 08:56:05,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-18 08:56:05,969 INFO L428 stractBuchiCegarLoop]: Abstraction has 170 states and 223 transitions. [2023-02-18 08:56:05,969 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2023-02-18 08:56:05,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 170 states and 223 transitions. [2023-02-18 08:56:05,970 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2023-02-18 08:56:05,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-18 08:56:05,971 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-18 08:56:05,973 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 15, 10, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2023-02-18 08:56:05,973 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [59, 58, 35, 24, 24, 24, 24, 24, 23, 23, 11, 11, 11, 11] [2023-02-18 08:56:05,973 INFO L748 eck$LassoCheckResult]: Stem: 11872#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 11843#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 11840#L29 assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 11841#L33 assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); 11842#L36 call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1);< 11844#$Ultimate##0 ~m := #in~m;~n := #in~n; 11910#L17 assume !(0 == ~m); 11908#L20 assume !(0 == ~n); 11888#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11900#$Ultimate##0 ~m := #in~m;~n := #in~n; 11901#L17 assume !(0 == ~m); 11887#L20 assume 0 == ~n; 11890#L21 call #t~ret4 := ackermann(~m - 1, 1);< 11905#$Ultimate##0 ~m := #in~m;~n := #in~n; 11906#L17 assume !(0 == ~m); 11899#L20 assume !(0 == ~n); 11885#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11894#$Ultimate##0 ~m := #in~m;~n := #in~n; 11892#L17 assume !(0 == ~m); 11883#L20 assume 0 == ~n; 11886#L21 call #t~ret4 := ackermann(~m - 1, 1);< 11905#$Ultimate##0 ~m := #in~m;~n := #in~n; 11906#L17 assume !(0 == ~m); 11899#L20 assume !(0 == ~n); 11885#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11894#$Ultimate##0 ~m := #in~m;~n := #in~n; 11892#L17 assume !(0 == ~m); 11883#L20 assume 0 == ~n; 11886#L21 call #t~ret4 := ackermann(~m - 1, 1);< 11923#$Ultimate##0 ~m := #in~m;~n := #in~n; 11952#L17 assume 0 == ~m;#res := 1 + ~n; 11951#ackermannFINAL assume true; 11949#ackermannEXIT >#43#return; 11947#L21-1 #res := #t~ret4;havoc #t~ret4; 11945#ackermannFINAL assume true; 11941#ackermannEXIT >#45#return; 11846#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11845#$Ultimate##0 ~m := #in~m;~n := #in~n; 11847#L17 assume 0 == ~m;#res := 1 + ~n; 11954#ackermannFINAL assume true; 11937#ackermannEXIT >#47#return; 11935#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11933#ackermannFINAL assume true; 11929#ackermannEXIT >#43#return; 11928#L21-1 #res := #t~ret4;havoc #t~ret4; 11927#ackermannFINAL assume true; 11924#ackermannEXIT >#45#return; 11925#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11964#$Ultimate##0 ~m := #in~m;~n := #in~n; 11984#L17 assume !(0 == ~m); 11982#L20 assume !(0 == ~n); 11837#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11895#$Ultimate##0 ~m := #in~m;~n := #in~n; 11896#L17 assume !(0 == ~m); 11911#L20 assume !(0 == ~n); 11835#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11895#$Ultimate##0 ~m := #in~m;~n := #in~n; 11896#L17 assume !(0 == ~m); 11911#L20 assume !(0 == ~n); 11835#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11895#$Ultimate##0 ~m := #in~m;~n := #in~n; 11893#L17 assume !(0 == ~m); 11891#L20 assume 0 == ~n; 11861#L21 call #t~ret4 := ackermann(~m - 1, 1);< 11862#$Ultimate##0 ~m := #in~m;~n := #in~n; 11953#L17 assume 0 == ~m;#res := 1 + ~n; 11875#ackermannFINAL assume true; 11950#ackermannEXIT >#43#return; 11866#L21-1 #res := #t~ret4;havoc #t~ret4; 11867#ackermannFINAL assume true; 11998#ackermannEXIT >#45#return; 11853#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11860#$Ultimate##0 ~m := #in~m;~n := #in~n; 11852#L17 assume 0 == ~m;#res := 1 + ~n; 11856#ackermannFINAL assume true; 11976#ackermannEXIT >#47#return; 11865#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11832#ackermannFINAL assume true; 11839#ackermannEXIT >#45#return; 11851#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11860#$Ultimate##0 ~m := #in~m;~n := #in~n; 11852#L17 assume 0 == ~m;#res := 1 + ~n; 11856#ackermannFINAL assume true; 11976#ackermannEXIT >#47#return; 11978#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11994#ackermannFINAL assume true; 11980#ackermannEXIT >#45#return; 11854#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11860#$Ultimate##0 ~m := #in~m;~n := #in~n; 11852#L17 assume 0 == ~m;#res := 1 + ~n; 11856#ackermannFINAL assume true; 11976#ackermannEXIT >#47#return; 11968#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11966#ackermannFINAL assume true; 11962#ackermannEXIT >#47#return; 11960#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11959#ackermannFINAL assume true; 11956#ackermannEXIT >#43#return; 11958#L21-1 #res := #t~ret4;havoc #t~ret4; 12000#ackermannFINAL assume true; 11997#ackermannEXIT >#45#return; 11877#L23-1 [2023-02-18 08:56:05,974 INFO L750 eck$LassoCheckResult]: Loop: 11877#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11921#$Ultimate##0 ~m := #in~m;~n := #in~n; 11922#L17 assume !(0 == ~m); 11990#L20 assume !(0 == ~n); 11838#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11848#$Ultimate##0 ~m := #in~m;~n := #in~n; 11849#L17 assume !(0 == ~m); 11857#L20 assume !(0 == ~n); 11834#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11848#$Ultimate##0 ~m := #in~m;~n := #in~n; 11850#L17 assume !(0 == ~m); 11858#L20 assume 0 == ~n; 11859#L21 call #t~ret4 := ackermann(~m - 1, 1);< 11876#$Ultimate##0 ~m := #in~m;~n := #in~n; 11874#L17 assume !(0 == ~m); 11873#L20 assume !(0 == ~n); 11868#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11871#$Ultimate##0 ~m := #in~m;~n := #in~n; 11914#L17 assume !(0 == ~m); 11932#L20 assume 0 == ~n; 11870#L21 call #t~ret4 := ackermann(~m - 1, 1);< 11876#$Ultimate##0 ~m := #in~m;~n := #in~n; 11874#L17 assume !(0 == ~m); 11873#L20 assume !(0 == ~n); 11868#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11871#$Ultimate##0 ~m := #in~m;~n := #in~n; 11914#L17 assume !(0 == ~m); 11932#L20 assume 0 == ~n; 11870#L21 call #t~ret4 := ackermann(~m - 1, 1);< 11876#$Ultimate##0 ~m := #in~m;~n := #in~n; 11874#L17 assume 0 == ~m;#res := 1 + ~n; 11875#ackermannFINAL assume true; 11950#ackermannEXIT >#43#return; 11948#L21-1 #res := #t~ret4;havoc #t~ret4; 11946#ackermannFINAL assume true; 11944#ackermannEXIT >#45#return; 11939#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11940#$Ultimate##0 ~m := #in~m;~n := #in~n; 11943#L17 assume 0 == ~m;#res := 1 + ~n; 11942#ackermannFINAL assume true; 11938#ackermannEXIT >#47#return; 11936#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11934#ackermannFINAL assume true; 11930#ackermannEXIT >#43#return; 11928#L21-1 #res := #t~ret4;havoc #t~ret4; 11927#ackermannFINAL assume true; 11924#ackermannEXIT >#45#return; 11925#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11964#$Ultimate##0 ~m := #in~m;~n := #in~n; 11984#L17 assume !(0 == ~m); 11982#L20 assume !(0 == ~n); 11837#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11895#$Ultimate##0 ~m := #in~m;~n := #in~n; 11896#L17 assume !(0 == ~m); 11911#L20 assume !(0 == ~n); 11835#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11895#$Ultimate##0 ~m := #in~m;~n := #in~n; 11896#L17 assume !(0 == ~m); 11911#L20 assume !(0 == ~n); 11835#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11895#$Ultimate##0 ~m := #in~m;~n := #in~n; 11893#L17 assume !(0 == ~m); 11891#L20 assume 0 == ~n; 11861#L21 call #t~ret4 := ackermann(~m - 1, 1);< 11862#$Ultimate##0 ~m := #in~m;~n := #in~n; 11953#L17 assume 0 == ~m;#res := 1 + ~n; 11875#ackermannFINAL assume true; 11950#ackermannEXIT >#43#return; 11866#L21-1 #res := #t~ret4;havoc #t~ret4; 11867#ackermannFINAL assume true; 11998#ackermannEXIT >#45#return; 11853#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11860#$Ultimate##0 ~m := #in~m;~n := #in~n; 11852#L17 assume 0 == ~m;#res := 1 + ~n; 11856#ackermannFINAL assume true; 11976#ackermannEXIT >#47#return; 11865#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11832#ackermannFINAL assume true; 11839#ackermannEXIT >#45#return; 11851#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11860#$Ultimate##0 ~m := #in~m;~n := #in~n; 11852#L17 assume 0 == ~m;#res := 1 + ~n; 11856#ackermannFINAL assume true; 11976#ackermannEXIT >#47#return; 11978#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11994#ackermannFINAL assume true; 11980#ackermannEXIT >#45#return; 11854#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11860#$Ultimate##0 ~m := #in~m;~n := #in~n; 11852#L17 assume 0 == ~m;#res := 1 + ~n; 11856#ackermannFINAL assume true; 11976#ackermannEXIT >#47#return; 11968#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11966#ackermannFINAL assume true; 11962#ackermannEXIT >#47#return; 11960#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11959#ackermannFINAL assume true; 11956#ackermannEXIT >#43#return; 11958#L21-1 #res := #t~ret4;havoc #t~ret4; 12000#ackermannFINAL assume true; 11997#ackermannEXIT >#45#return; 11881#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11921#$Ultimate##0 ~m := #in~m;~n := #in~n; 11922#L17 assume !(0 == ~m); 11990#L20 assume !(0 == ~n); 11838#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11848#$Ultimate##0 ~m := #in~m;~n := #in~n; 11849#L17 assume !(0 == ~m); 11857#L20 assume !(0 == ~n); 11834#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11848#$Ultimate##0 ~m := #in~m;~n := #in~n; 11849#L17 assume !(0 == ~m); 11857#L20 assume !(0 == ~n); 11834#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11848#$Ultimate##0 ~m := #in~m;~n := #in~n; 11850#L17 assume !(0 == ~m); 11858#L20 assume 0 == ~n; 11859#L21 call #t~ret4 := ackermann(~m - 1, 1);< 11876#$Ultimate##0 ~m := #in~m;~n := #in~n; 11874#L17 assume !(0 == ~m); 11873#L20 assume !(0 == ~n); 11868#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11871#$Ultimate##0 ~m := #in~m;~n := #in~n; 11914#L17 assume !(0 == ~m); 11932#L20 assume 0 == ~n; 11870#L21 call #t~ret4 := ackermann(~m - 1, 1);< 11876#$Ultimate##0 ~m := #in~m;~n := #in~n; 11874#L17 assume !(0 == ~m); 11873#L20 assume !(0 == ~n); 11868#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11871#$Ultimate##0 ~m := #in~m;~n := #in~n; 11914#L17 assume !(0 == ~m); 11932#L20 assume 0 == ~n; 11870#L21 call #t~ret4 := ackermann(~m - 1, 1);< 11876#$Ultimate##0 ~m := #in~m;~n := #in~n; 11874#L17 assume 0 == ~m;#res := 1 + ~n; 11875#ackermannFINAL assume true; 11950#ackermannEXIT >#43#return; 11948#L21-1 #res := #t~ret4;havoc #t~ret4; 11946#ackermannFINAL assume true; 11944#ackermannEXIT >#45#return; 11939#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11940#$Ultimate##0 ~m := #in~m;~n := #in~n; 11943#L17 assume 0 == ~m;#res := 1 + ~n; 11942#ackermannFINAL assume true; 11938#ackermannEXIT >#47#return; 11936#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11934#ackermannFINAL assume true; 11930#ackermannEXIT >#43#return; 11928#L21-1 #res := #t~ret4;havoc #t~ret4; 11927#ackermannFINAL assume true; 11924#ackermannEXIT >#45#return; 11925#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11964#$Ultimate##0 ~m := #in~m;~n := #in~n; 11984#L17 assume !(0 == ~m); 11982#L20 assume !(0 == ~n); 11837#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11895#$Ultimate##0 ~m := #in~m;~n := #in~n; 11896#L17 assume !(0 == ~m); 11911#L20 assume !(0 == ~n); 11835#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11895#$Ultimate##0 ~m := #in~m;~n := #in~n; 11896#L17 assume !(0 == ~m); 11911#L20 assume !(0 == ~n); 11835#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11895#$Ultimate##0 ~m := #in~m;~n := #in~n; 11893#L17 assume !(0 == ~m); 11891#L20 assume 0 == ~n; 11861#L21 call #t~ret4 := ackermann(~m - 1, 1);< 11862#$Ultimate##0 ~m := #in~m;~n := #in~n; 11953#L17 assume 0 == ~m;#res := 1 + ~n; 11875#ackermannFINAL assume true; 11950#ackermannEXIT >#43#return; 11866#L21-1 #res := #t~ret4;havoc #t~ret4; 11867#ackermannFINAL assume true; 11998#ackermannEXIT >#45#return; 11853#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11860#$Ultimate##0 ~m := #in~m;~n := #in~n; 11852#L17 assume 0 == ~m;#res := 1 + ~n; 11856#ackermannFINAL assume true; 11976#ackermannEXIT >#47#return; 11865#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11832#ackermannFINAL assume true; 11839#ackermannEXIT >#45#return; 11851#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11860#$Ultimate##0 ~m := #in~m;~n := #in~n; 11852#L17 assume 0 == ~m;#res := 1 + ~n; 11856#ackermannFINAL assume true; 11976#ackermannEXIT >#47#return; 11978#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11994#ackermannFINAL assume true; 11980#ackermannEXIT >#45#return; 11854#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11860#$Ultimate##0 ~m := #in~m;~n := #in~n; 11852#L17 assume 0 == ~m;#res := 1 + ~n; 11856#ackermannFINAL assume true; 11976#ackermannEXIT >#47#return; 11968#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11966#ackermannFINAL assume true; 11962#ackermannEXIT >#47#return; 11960#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11959#ackermannFINAL assume true; 11956#ackermannEXIT >#43#return; 11958#L21-1 #res := #t~ret4;havoc #t~ret4; 12000#ackermannFINAL assume true; 11997#ackermannEXIT >#45#return; 11881#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11921#$Ultimate##0 ~m := #in~m;~n := #in~n; 11922#L17 assume !(0 == ~m); 11990#L20 assume !(0 == ~n); 11838#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11848#$Ultimate##0 ~m := #in~m;~n := #in~n; 11849#L17 assume !(0 == ~m); 11857#L20 assume !(0 == ~n); 11834#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11848#$Ultimate##0 ~m := #in~m;~n := #in~n; 11849#L17 assume !(0 == ~m); 11857#L20 assume !(0 == ~n); 11834#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11848#$Ultimate##0 ~m := #in~m;~n := #in~n; 11850#L17 assume !(0 == ~m); 11858#L20 assume 0 == ~n; 11859#L21 call #t~ret4 := ackermann(~m - 1, 1);< 11876#$Ultimate##0 ~m := #in~m;~n := #in~n; 11874#L17 assume 0 == ~m;#res := 1 + ~n; 11875#ackermannFINAL assume true; 11950#ackermannEXIT >#43#return; 11866#L21-1 #res := #t~ret4;havoc #t~ret4; 11867#ackermannFINAL assume true; 11998#ackermannEXIT >#45#return; 11853#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11860#$Ultimate##0 ~m := #in~m;~n := #in~n; 11852#L17 assume 0 == ~m;#res := 1 + ~n; 11856#ackermannFINAL assume true; 11976#ackermannEXIT >#47#return; 11865#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11832#ackermannFINAL assume true; 11839#ackermannEXIT >#45#return; 11851#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11860#$Ultimate##0 ~m := #in~m;~n := #in~n; 11852#L17 assume 0 == ~m;#res := 1 + ~n; 11856#ackermannFINAL assume true; 11976#ackermannEXIT >#47#return; 11978#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11994#ackermannFINAL assume true; 11980#ackermannEXIT >#45#return; 11855#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11860#$Ultimate##0 ~m := #in~m;~n := #in~n; 11852#L17 assume 0 == ~m;#res := 1 + ~n; 11856#ackermannFINAL assume true; 11976#ackermannEXIT >#47#return; 11977#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11988#ackermannFINAL assume true; 11973#ackermannEXIT >#47#return; 11975#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11955#ackermannFINAL assume true; 11926#ackermannEXIT >#45#return; 11916#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11915#$Ultimate##0 ~m := #in~m;~n := #in~n; 11920#L17 assume !(0 == ~m); 11991#L20 assume !(0 == ~n); 11836#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11895#$Ultimate##0 ~m := #in~m;~n := #in~n; 11896#L17 assume !(0 == ~m); 11911#L20 assume !(0 == ~n); 11835#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11895#$Ultimate##0 ~m := #in~m;~n := #in~n; 11896#L17 assume !(0 == ~m); 11911#L20 assume !(0 == ~n); 11835#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11895#$Ultimate##0 ~m := #in~m;~n := #in~n; 11893#L17 assume !(0 == ~m); 11891#L20 assume 0 == ~n; 11861#L21 call #t~ret4 := ackermann(~m - 1, 1);< 11862#$Ultimate##0 ~m := #in~m;~n := #in~n; 11953#L17 assume 0 == ~m;#res := 1 + ~n; 11875#ackermannFINAL assume true; 11950#ackermannEXIT >#43#return; 11866#L21-1 #res := #t~ret4;havoc #t~ret4; 11867#ackermannFINAL assume true; 11998#ackermannEXIT >#45#return; 11853#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11860#$Ultimate##0 ~m := #in~m;~n := #in~n; 11852#L17 assume 0 == ~m;#res := 1 + ~n; 11856#ackermannFINAL assume true; 11976#ackermannEXIT >#47#return; 11865#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11832#ackermannFINAL assume true; 11839#ackermannEXIT >#45#return; 11851#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11860#$Ultimate##0 ~m := #in~m;~n := #in~n; 11852#L17 assume 0 == ~m;#res := 1 + ~n; 11856#ackermannFINAL assume true; 11976#ackermannEXIT >#47#return; 11978#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11994#ackermannFINAL assume true; 11980#ackermannEXIT >#45#return; 11855#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11860#$Ultimate##0 ~m := #in~m;~n := #in~n; 11852#L17 assume 0 == ~m;#res := 1 + ~n; 11856#ackermannFINAL assume true; 11976#ackermannEXIT >#47#return; 11977#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11988#ackermannFINAL assume true; 11973#ackermannEXIT >#47#return; 11974#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11993#ackermannFINAL assume true; 11979#ackermannEXIT >#45#return; 11918#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11915#$Ultimate##0 ~m := #in~m;~n := #in~n; 11920#L17 assume !(0 == ~m); 11991#L20 assume !(0 == ~n); 11836#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11895#$Ultimate##0 ~m := #in~m;~n := #in~n; 11896#L17 assume !(0 == ~m); 11911#L20 assume !(0 == ~n); 11835#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11895#$Ultimate##0 ~m := #in~m;~n := #in~n; 11896#L17 assume !(0 == ~m); 11911#L20 assume !(0 == ~n); 11835#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 11895#$Ultimate##0 ~m := #in~m;~n := #in~n; 11893#L17 assume !(0 == ~m); 11891#L20 assume 0 == ~n; 11861#L21 call #t~ret4 := ackermann(~m - 1, 1);< 11862#$Ultimate##0 ~m := #in~m;~n := #in~n; 11953#L17 assume 0 == ~m;#res := 1 + ~n; 11875#ackermannFINAL assume true; 11950#ackermannEXIT >#43#return; 11866#L21-1 #res := #t~ret4;havoc #t~ret4; 11867#ackermannFINAL assume true; 11998#ackermannEXIT >#45#return; 11853#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11860#$Ultimate##0 ~m := #in~m;~n := #in~n; 11852#L17 assume 0 == ~m;#res := 1 + ~n; 11856#ackermannFINAL assume true; 11976#ackermannEXIT >#47#return; 11865#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11832#ackermannFINAL assume true; 11839#ackermannEXIT >#45#return; 11851#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11860#$Ultimate##0 ~m := #in~m;~n := #in~n; 11852#L17 assume 0 == ~m;#res := 1 + ~n; 11856#ackermannFINAL assume true; 11976#ackermannEXIT >#47#return; 11978#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11994#ackermannFINAL assume true; 11980#ackermannEXIT >#45#return; 11855#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 11860#$Ultimate##0 ~m := #in~m;~n := #in~n; 11852#L17 assume 0 == ~m;#res := 1 + ~n; 11856#ackermannFINAL assume true; 11976#ackermannEXIT >#47#return; 11977#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11988#ackermannFINAL assume true; 11973#ackermannEXIT >#47#return; 11971#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11987#ackermannFINAL assume true; 11969#ackermannEXIT >#47#return; 11972#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 11996#ackermannFINAL assume true; 11995#ackermannEXIT >#45#return; 11877#L23-1 [2023-02-18 08:56:05,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:56:05,975 INFO L85 PathProgramCache]: Analyzing trace with hash 478890302, now seen corresponding path program 7 times [2023-02-18 08:56:05,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:56:05,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394361856] [2023-02-18 08:56:05,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:56:05,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:56:05,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:56:05,991 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 08:56:06,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:56:06,012 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 08:56:06,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:56:06,013 INFO L85 PathProgramCache]: Analyzing trace with hash 888511461, now seen corresponding path program 5 times [2023-02-18 08:56:06,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:56:06,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128722479] [2023-02-18 08:56:06,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:56:06,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:56:06,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:06,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-18 08:56:06,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:07,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:07,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:07,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:07,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:07,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:07,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:07,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:07,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:07,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:07,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:07,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:07,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:07,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:07,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-18 08:56:07,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:07,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:07,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:07,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:07,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:07,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:07,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:07,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:07,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:07,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:07,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:56:07,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:07,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:56:07,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:07,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-02-18 08:56:07,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:07,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:07,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:08,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:08,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:08,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:08,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:08,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:08,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:08,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:08,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:08,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:08,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:08,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:08,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:08,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:08,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:08,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:08,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-18 08:56:08,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:08,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:08,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:08,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:08,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:08,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:08,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:08,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:08,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:08,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:08,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:08,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:56:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:08,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:56:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:08,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-02-18 08:56:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:08,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:08,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:08,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:08,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:08,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:08,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:08,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:08,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:08,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:08,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:08,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:56:08,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:08,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:56:08,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:08,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-02-18 08:56:08,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:08,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:08,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:08,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:08,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:08,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:08,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:08,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:08,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:08,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:08,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:08,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:56:08,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:08,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:56:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:08,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-02-18 08:56:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:08,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:08,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:08,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:08,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:08,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:08,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:08,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:08,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:08,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:08,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:56:08,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:08,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:56:08,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:08,664 INFO L134 CoverageAnalysis]: Checked inductivity of 8238 backedges. 1382 proven. 1901 refuted. 0 times theorem prover too weak. 4955 trivial. 0 not checked. [2023-02-18 08:56:08,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:56:08,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128722479] [2023-02-18 08:56:08,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128722479] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 08:56:08,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829517930] [2023-02-18 08:56:08,665 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-18 08:56:08,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 08:56:08,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:56:08,677 INFO L229 MonitoredProcess]: Starting monitored process 160 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 08:56:08,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (160)] Waiting until timeout for monitored process [2023-02-18 08:56:08,927 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2023-02-18 08:56:08,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 08:56:08,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-18 08:56:08,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:56:09,236 INFO L134 CoverageAnalysis]: Checked inductivity of 8238 backedges. 787 proven. 1614 refuted. 0 times theorem prover too weak. 5837 trivial. 0 not checked. [2023-02-18 08:56:09,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 08:56:10,238 INFO L134 CoverageAnalysis]: Checked inductivity of 8238 backedges. 841 proven. 1606 refuted. 0 times theorem prover too weak. 5791 trivial. 0 not checked. [2023-02-18 08:56:10,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829517930] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 08:56:10,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 08:56:10,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21, 28] total 49 [2023-02-18 08:56:10,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779017561] [2023-02-18 08:56:10,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 08:56:10,256 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-18 08:56:10,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 08:56:10,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-02-18 08:56:10,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2151, Unknown=0, NotChecked=0, Total=2352 [2023-02-18 08:56:10,258 INFO L87 Difference]: Start difference. First operand 170 states and 223 transitions. cyclomatic complexity: 57 Second operand has 49 states, 38 states have (on average 2.0789473684210527) internal successors, (79), 30 states have internal predecessors, (79), 22 states have call successors, (26), 1 states have call predecessors, (26), 23 states have return successors, (53), 32 states have call predecessors, (53), 22 states have call successors, (53) [2023-02-18 08:56:12,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 08:56:12,430 INFO L93 Difference]: Finished difference Result 312 states and 453 transitions. [2023-02-18 08:56:12,431 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 312 states and 453 transitions. [2023-02-18 08:56:12,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2023-02-18 08:56:12,439 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 312 states to 283 states and 396 transitions. [2023-02-18 08:56:12,439 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 234 [2023-02-18 08:56:12,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 234 [2023-02-18 08:56:12,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 283 states and 396 transitions. [2023-02-18 08:56:12,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-18 08:56:12,441 INFO L218 hiAutomatonCegarLoop]: Abstraction has 283 states and 396 transitions. [2023-02-18 08:56:12,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states and 396 transitions. [2023-02-18 08:56:12,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 241. [2023-02-18 08:56:12,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 152 states have (on average 1.0460526315789473) internal successors, (159), 156 states have internal predecessors, (159), 52 states have call successors, (55), 25 states have call predecessors, (55), 37 states have return successors, (104), 59 states have call predecessors, (104), 48 states have call successors, (104) [2023-02-18 08:56:12,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 318 transitions. [2023-02-18 08:56:12,454 INFO L240 hiAutomatonCegarLoop]: Abstraction has 241 states and 318 transitions. [2023-02-18 08:56:12,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2023-02-18 08:56:12,455 INFO L428 stractBuchiCegarLoop]: Abstraction has 241 states and 318 transitions. [2023-02-18 08:56:12,455 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2023-02-18 08:56:12,456 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 241 states and 318 transitions. [2023-02-18 08:56:12,457 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2023-02-18 08:56:12,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-18 08:56:12,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-18 08:56:12,465 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [66, 64, 39, 27, 27, 27, 27, 26, 26, 26, 12, 12, 11, 11, 1, 1, 1, 1, 1] [2023-02-18 08:56:12,466 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [66, 64, 39, 27, 27, 27, 27, 27, 26, 26, 12, 12, 11, 11] [2023-02-18 08:56:12,467 INFO L748 eck$LassoCheckResult]: Stem: 16872#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 16819#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 16816#L29 assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 16817#L33 assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); 16818#L36 call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1);< 16820#$Ultimate##0 ~m := #in~m;~n := #in~n; 16881#L17 assume !(0 == ~m); 16874#L20 assume 0 == ~n; 16862#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16863#$Ultimate##0 ~m := #in~m;~n := #in~n; 16928#L17 assume !(0 == ~m); 16927#L20 assume !(0 == ~n); 16877#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16880#$Ultimate##0 ~m := #in~m;~n := #in~n; 16879#L17 assume !(0 == ~m); 16875#L20 assume 0 == ~n; 16878#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16890#$Ultimate##0 ~m := #in~m;~n := #in~n; 16888#L17 assume !(0 == ~m); 16882#L20 assume !(0 == ~n); 16876#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16880#$Ultimate##0 ~m := #in~m;~n := #in~n; 16879#L17 assume !(0 == ~m); 16875#L20 assume 0 == ~n; 16878#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16890#$Ultimate##0 ~m := #in~m;~n := #in~n; 16888#L17 assume !(0 == ~m); 16882#L20 assume !(0 == ~n); 16876#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16880#$Ultimate##0 ~m := #in~m;~n := #in~n; 16879#L17 assume !(0 == ~m); 16875#L20 assume 0 == ~n; 16878#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16890#$Ultimate##0 ~m := #in~m;~n := #in~n; 16888#L17 assume !(0 == ~m); 16882#L20 assume !(0 == ~n); 16876#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16880#$Ultimate##0 ~m := #in~m;~n := #in~n; 16879#L17 assume !(0 == ~m); 16875#L20 assume 0 == ~n; 16878#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16922#$Ultimate##0 ~m := #in~m;~n := #in~n; 16970#L17 assume 0 == ~m;#res := 1 + ~n; 16967#ackermannFINAL assume true; 16965#ackermannEXIT >#43#return; 16963#L21-1 #res := #t~ret4;havoc #t~ret4; 16960#ackermannFINAL assume true; 16957#ackermannEXIT >#45#return; 16951#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16952#$Ultimate##0 ~m := #in~m;~n := #in~n; 16962#L17 assume 0 == ~m;#res := 1 + ~n; 16956#ackermannFINAL assume true; 16950#ackermannEXIT >#47#return; 16948#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16946#ackermannFINAL assume true; 16944#ackermannEXIT >#43#return; 16943#L21-1 #res := #t~ret4;havoc #t~ret4; 16942#ackermannFINAL assume true; 16941#ackermannEXIT >#45#return; 16939#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16940#$Ultimate##0 ~m := #in~m;~n := #in~n; 16983#L17 assume !(0 == ~m); 16982#L20 assume !(0 == ~n); 16861#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16904#L17 assume !(0 == ~m); 16973#L20 assume 0 == ~n; 16822#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16821#$Ultimate##0 ~m := #in~m;~n := #in~n; 16823#L17 assume 0 == ~m;#res := 1 + ~n; 16971#ackermannFINAL assume true; 16968#ackermannEXIT >#43#return; 16969#L21-1 #res := #t~ret4;havoc #t~ret4; 16989#ackermannFINAL assume true; 16988#ackermannEXIT >#45#return; 16835#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16977#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16986#ackermannFINAL assume true; 16985#ackermannEXIT >#45#return; 16838#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16979#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 17012#ackermannFINAL assume true; 17010#ackermannEXIT >#45#return; 16837#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16975#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16974#ackermannFINAL assume true; 16938#ackermannEXIT >#47#return; 16935#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16934#ackermannFINAL assume true; 16930#ackermannEXIT >#43#return; 16929#L21-1 #res := #t~ret4;havoc #t~ret4; 16926#ackermannFINAL assume true; 16923#ackermannEXIT >#45#return; 16924#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16998#$Ultimate##0 ~m := #in~m;~n := #in~n; 17011#L17 assume !(0 == ~m); 17009#L20 assume !(0 == ~n); 16865#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16912#$Ultimate##0 ~m := #in~m;~n := #in~n; 16913#L17 assume !(0 == ~m); 16915#L20 assume !(0 == ~n); 16866#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16912#$Ultimate##0 ~m := #in~m;~n := #in~n; 16913#L17 assume !(0 == ~m); 16915#L20 assume !(0 == ~n); 16866#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16912#$Ultimate##0 ~m := #in~m;~n := #in~n; 16913#L17 assume !(0 == ~m); 16915#L20 assume !(0 == ~n); 16866#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16912#$Ultimate##0 ~m := #in~m;~n := #in~n; 16911#L17 assume !(0 == ~m); 16910#L20 assume 0 == ~n; 16906#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16909#$Ultimate##0 ~m := #in~m;~n := #in~n; 16908#L17 assume !(0 == ~m); 16907#L20 assume !(0 == ~n); 16900#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16902#$Ultimate##0 ~m := #in~m;~n := #in~n; 16901#L17 assume !(0 == ~m); 16899#L20 assume 0 == ~n; 16824#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16821#$Ultimate##0 ~m := #in~m;~n := #in~n; 16823#L17 assume 0 == ~m;#res := 1 + ~n; 16971#ackermannFINAL assume true; 16968#ackermannEXIT >#43#return; 16966#L21-1 #res := #t~ret4;havoc #t~ret4; 16964#ackermannFINAL assume true; 16961#ackermannEXIT >#45#return; 16954#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16955#$Ultimate##0 ~m := #in~m;~n := #in~n; 16959#L17 assume 0 == ~m;#res := 1 + ~n; 16958#ackermannFINAL assume true; 16953#ackermannEXIT >#47#return; 16949#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16947#ackermannFINAL assume true; 16945#ackermannEXIT >#43#return; 16864#L21-1 #res := #t~ret4;havoc #t~ret4; 16867#ackermannFINAL assume true; 17047#ackermannEXIT >#45#return; 16810#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16916#$Ultimate##0 ~m := #in~m;~n := #in~n; 16917#L17 assume !(0 == ~m); 16987#L20 assume !(0 == ~n); 16860#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16904#L17 assume !(0 == ~m); 16973#L20 assume 0 == ~n; 16822#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16821#$Ultimate##0 ~m := #in~m;~n := #in~n; 16823#L17 assume 0 == ~m;#res := 1 + ~n; 16971#ackermannFINAL assume true; 16968#ackermannEXIT >#43#return; 16969#L21-1 #res := #t~ret4;havoc #t~ret4; 16989#ackermannFINAL assume true; 16988#ackermannEXIT >#45#return; 16835#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16977#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16986#ackermannFINAL assume true; 16985#ackermannEXIT >#45#return; 16838#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16979#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 17012#ackermannFINAL assume true; 17010#ackermannEXIT >#45#return; 16832#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16868#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16809#ackermannFINAL assume true; 16815#ackermannEXIT >#47#return; 16831#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 17049#ackermannFINAL assume true; 17048#ackermannEXIT >#45#return; 16812#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16916#$Ultimate##0 ~m := #in~m;~n := #in~n; 16917#L17 assume !(0 == ~m); 16987#L20 assume !(0 == ~n); 16860#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16904#L17 assume !(0 == ~m); 16973#L20 assume 0 == ~n; 16822#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16821#$Ultimate##0 ~m := #in~m;~n := #in~n; 16823#L17 assume 0 == ~m;#res := 1 + ~n; 16971#ackermannFINAL assume true; 16968#ackermannEXIT >#43#return; 16969#L21-1 #res := #t~ret4;havoc #t~ret4; 16989#ackermannFINAL assume true; 16988#ackermannEXIT >#45#return; 16835#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16977#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16986#ackermannFINAL assume true; 16985#ackermannEXIT >#45#return; 16838#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16979#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 17012#ackermannFINAL assume true; 17010#ackermannEXIT >#45#return; 16836#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16978#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16984#ackermannFINAL assume true; 16981#ackermannEXIT >#45#return; 16839#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16980#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 17007#ackermannFINAL assume true; 17003#ackermannEXIT >#47#return; 17006#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 17046#ackermannFINAL assume true; 17045#ackermannEXIT >#45#return; 16811#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16916#$Ultimate##0 ~m := #in~m;~n := #in~n; 16917#L17 assume !(0 == ~m); 16987#L20 assume !(0 == ~n); 16860#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16904#L17 assume !(0 == ~m); 16973#L20 assume 0 == ~n; 16822#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16821#$Ultimate##0 ~m := #in~m;~n := #in~n; 16823#L17 assume 0 == ~m;#res := 1 + ~n; 16971#ackermannFINAL assume true; 16968#ackermannEXIT >#43#return; 16969#L21-1 #res := #t~ret4;havoc #t~ret4; 16989#ackermannFINAL assume true; 16988#ackermannEXIT >#45#return; 16835#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16977#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16986#ackermannFINAL assume true; 16985#ackermannEXIT >#45#return; 16838#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16979#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 17012#ackermannFINAL assume true; 17010#ackermannEXIT >#45#return; 16836#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16978#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16984#ackermannFINAL assume true; 16981#ackermannEXIT >#45#return; 16839#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16980#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 17007#ackermannFINAL assume true; 17003#ackermannEXIT >#47#return; 17004#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 17017#ackermannFINAL assume true; 17008#ackermannEXIT >#45#return; 16813#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16916#$Ultimate##0 ~m := #in~m;~n := #in~n; 16917#L17 assume !(0 == ~m); 16987#L20 assume !(0 == ~n); 16860#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16904#L17 assume !(0 == ~m); 16973#L20 assume 0 == ~n; 16822#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16821#$Ultimate##0 ~m := #in~m;~n := #in~n; 16823#L17 assume 0 == ~m;#res := 1 + ~n; 16971#ackermannFINAL assume true; 16968#ackermannEXIT >#43#return; 16969#L21-1 #res := #t~ret4;havoc #t~ret4; 16989#ackermannFINAL assume true; 16988#ackermannEXIT >#45#return; 16835#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16977#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16986#ackermannFINAL assume true; 16985#ackermannEXIT >#45#return; 16838#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16979#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 17012#ackermannFINAL assume true; 17010#ackermannEXIT >#45#return; 16836#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16978#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16984#ackermannFINAL assume true; 16981#ackermannEXIT >#45#return; 16839#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16980#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 17007#ackermannFINAL assume true; 17003#ackermannEXIT >#47#return; 17001#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16999#ackermannFINAL assume true; 16996#ackermannEXIT >#47#return; 16994#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16993#ackermannFINAL assume true; 16990#ackermannEXIT >#43#return; 16991#L21-1 #res := #t~ret4;havoc #t~ret4; 17002#ackermannFINAL assume true; 17000#ackermannEXIT >#45#return; 16897#L23-1 [2023-02-18 08:56:12,468 INFO L750 eck$LassoCheckResult]: Loop: 16897#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16997#$Ultimate##0 ~m := #in~m;~n := #in~n; 16921#L17 assume !(0 == ~m); 16936#L20 assume 0 == ~n; 16869#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16896#$Ultimate##0 ~m := #in~m;~n := #in~n; 16895#L17 assume !(0 == ~m); 16873#L20 assume !(0 == ~n); 16850#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16871#$Ultimate##0 ~m := #in~m;~n := #in~n; 16898#L17 assume !(0 == ~m); 16849#L20 assume 0 == ~n; 16851#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16932#$Ultimate##0 ~m := #in~m;~n := #in~n; 16972#L17 assume !(0 == ~m); 16873#L20 assume !(0 == ~n); 16850#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16871#$Ultimate##0 ~m := #in~m;~n := #in~n; 16898#L17 assume !(0 == ~m); 16849#L20 assume 0 == ~n; 16851#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16932#$Ultimate##0 ~m := #in~m;~n := #in~n; 16972#L17 assume !(0 == ~m); 16873#L20 assume !(0 == ~n); 16850#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16871#$Ultimate##0 ~m := #in~m;~n := #in~n; 16898#L17 assume !(0 == ~m); 16849#L20 assume 0 == ~n; 16851#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16932#$Ultimate##0 ~m := #in~m;~n := #in~n; 16972#L17 assume !(0 == ~m); 16873#L20 assume !(0 == ~n); 16850#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16871#$Ultimate##0 ~m := #in~m;~n := #in~n; 16898#L17 assume !(0 == ~m); 16849#L20 assume 0 == ~n; 16851#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16932#$Ultimate##0 ~m := #in~m;~n := #in~n; 16972#L17 assume 0 == ~m;#res := 1 + ~n; 16971#ackermannFINAL assume true; 16968#ackermannEXIT >#43#return; 16966#L21-1 #res := #t~ret4;havoc #t~ret4; 16964#ackermannFINAL assume true; 16961#ackermannEXIT >#45#return; 16954#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16955#$Ultimate##0 ~m := #in~m;~n := #in~n; 16959#L17 assume 0 == ~m;#res := 1 + ~n; 16958#ackermannFINAL assume true; 16953#ackermannEXIT >#47#return; 16949#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16947#ackermannFINAL assume true; 16945#ackermannEXIT >#43#return; 16943#L21-1 #res := #t~ret4;havoc #t~ret4; 16942#ackermannFINAL assume true; 16941#ackermannEXIT >#45#return; 16939#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16940#$Ultimate##0 ~m := #in~m;~n := #in~n; 16983#L17 assume !(0 == ~m); 16982#L20 assume !(0 == ~n); 16861#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16904#L17 assume !(0 == ~m); 16973#L20 assume 0 == ~n; 16822#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16821#$Ultimate##0 ~m := #in~m;~n := #in~n; 16823#L17 assume 0 == ~m;#res := 1 + ~n; 16971#ackermannFINAL assume true; 16968#ackermannEXIT >#43#return; 16969#L21-1 #res := #t~ret4;havoc #t~ret4; 16989#ackermannFINAL assume true; 16988#ackermannEXIT >#45#return; 16835#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16977#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16986#ackermannFINAL assume true; 16985#ackermannEXIT >#45#return; 16838#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16979#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 17012#ackermannFINAL assume true; 17010#ackermannEXIT >#45#return; 16837#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16975#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16974#ackermannFINAL assume true; 16938#ackermannEXIT >#47#return; 16935#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16934#ackermannFINAL assume true; 16930#ackermannEXIT >#43#return; 16929#L21-1 #res := #t~ret4;havoc #t~ret4; 16926#ackermannFINAL assume true; 16923#ackermannEXIT >#45#return; 16924#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16998#$Ultimate##0 ~m := #in~m;~n := #in~n; 17011#L17 assume !(0 == ~m); 17009#L20 assume !(0 == ~n); 16865#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16912#$Ultimate##0 ~m := #in~m;~n := #in~n; 16913#L17 assume !(0 == ~m); 16915#L20 assume !(0 == ~n); 16866#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16912#$Ultimate##0 ~m := #in~m;~n := #in~n; 16913#L17 assume !(0 == ~m); 16915#L20 assume !(0 == ~n); 16866#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16912#$Ultimate##0 ~m := #in~m;~n := #in~n; 16913#L17 assume !(0 == ~m); 16915#L20 assume !(0 == ~n); 16866#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16912#$Ultimate##0 ~m := #in~m;~n := #in~n; 16911#L17 assume !(0 == ~m); 16910#L20 assume 0 == ~n; 16906#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16909#$Ultimate##0 ~m := #in~m;~n := #in~n; 16908#L17 assume !(0 == ~m); 16907#L20 assume !(0 == ~n); 16900#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16902#$Ultimate##0 ~m := #in~m;~n := #in~n; 16901#L17 assume !(0 == ~m); 16899#L20 assume 0 == ~n; 16824#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16821#$Ultimate##0 ~m := #in~m;~n := #in~n; 16823#L17 assume 0 == ~m;#res := 1 + ~n; 16971#ackermannFINAL assume true; 16968#ackermannEXIT >#43#return; 16966#L21-1 #res := #t~ret4;havoc #t~ret4; 16964#ackermannFINAL assume true; 16961#ackermannEXIT >#45#return; 16954#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16955#$Ultimate##0 ~m := #in~m;~n := #in~n; 16959#L17 assume 0 == ~m;#res := 1 + ~n; 16958#ackermannFINAL assume true; 16953#ackermannEXIT >#47#return; 16949#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16947#ackermannFINAL assume true; 16945#ackermannEXIT >#43#return; 16864#L21-1 #res := #t~ret4;havoc #t~ret4; 16867#ackermannFINAL assume true; 17047#ackermannEXIT >#45#return; 16810#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16916#$Ultimate##0 ~m := #in~m;~n := #in~n; 16917#L17 assume !(0 == ~m); 16987#L20 assume !(0 == ~n); 16860#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16904#L17 assume !(0 == ~m); 16973#L20 assume 0 == ~n; 16822#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16821#$Ultimate##0 ~m := #in~m;~n := #in~n; 16823#L17 assume 0 == ~m;#res := 1 + ~n; 16971#ackermannFINAL assume true; 16968#ackermannEXIT >#43#return; 16969#L21-1 #res := #t~ret4;havoc #t~ret4; 16989#ackermannFINAL assume true; 16988#ackermannEXIT >#45#return; 16835#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16977#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16986#ackermannFINAL assume true; 16985#ackermannEXIT >#45#return; 16838#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16979#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 17012#ackermannFINAL assume true; 17010#ackermannEXIT >#45#return; 16832#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16868#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16809#ackermannFINAL assume true; 16815#ackermannEXIT >#47#return; 16831#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 17049#ackermannFINAL assume true; 17048#ackermannEXIT >#45#return; 16812#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16916#$Ultimate##0 ~m := #in~m;~n := #in~n; 16917#L17 assume !(0 == ~m); 16987#L20 assume !(0 == ~n); 16860#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16904#L17 assume !(0 == ~m); 16973#L20 assume 0 == ~n; 16822#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16821#$Ultimate##0 ~m := #in~m;~n := #in~n; 16823#L17 assume 0 == ~m;#res := 1 + ~n; 16971#ackermannFINAL assume true; 16968#ackermannEXIT >#43#return; 16969#L21-1 #res := #t~ret4;havoc #t~ret4; 16989#ackermannFINAL assume true; 16988#ackermannEXIT >#45#return; 16835#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16977#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16986#ackermannFINAL assume true; 16985#ackermannEXIT >#45#return; 16838#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16979#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 17012#ackermannFINAL assume true; 17010#ackermannEXIT >#45#return; 16836#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16978#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16984#ackermannFINAL assume true; 16981#ackermannEXIT >#45#return; 16839#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16980#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 17007#ackermannFINAL assume true; 17003#ackermannEXIT >#47#return; 17006#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 17046#ackermannFINAL assume true; 17045#ackermannEXIT >#45#return; 16811#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16916#$Ultimate##0 ~m := #in~m;~n := #in~n; 16917#L17 assume !(0 == ~m); 16987#L20 assume !(0 == ~n); 16860#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16904#L17 assume !(0 == ~m); 16973#L20 assume 0 == ~n; 16822#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16821#$Ultimate##0 ~m := #in~m;~n := #in~n; 16823#L17 assume 0 == ~m;#res := 1 + ~n; 16971#ackermannFINAL assume true; 16968#ackermannEXIT >#43#return; 16969#L21-1 #res := #t~ret4;havoc #t~ret4; 16989#ackermannFINAL assume true; 16988#ackermannEXIT >#45#return; 16835#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16977#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16986#ackermannFINAL assume true; 16985#ackermannEXIT >#45#return; 16838#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16979#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 17012#ackermannFINAL assume true; 17010#ackermannEXIT >#45#return; 16836#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16978#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16984#ackermannFINAL assume true; 16981#ackermannEXIT >#45#return; 16839#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16980#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 17007#ackermannFINAL assume true; 17003#ackermannEXIT >#47#return; 17004#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 17017#ackermannFINAL assume true; 17008#ackermannEXIT >#45#return; 16813#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16916#$Ultimate##0 ~m := #in~m;~n := #in~n; 16917#L17 assume !(0 == ~m); 16987#L20 assume !(0 == ~n); 16860#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16905#L17 assume !(0 == ~m); 16914#L20 assume !(0 == ~n); 16859#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 16903#$Ultimate##0 ~m := #in~m;~n := #in~n; 16904#L17 assume !(0 == ~m); 16973#L20 assume 0 == ~n; 16822#L21 call #t~ret4 := ackermann(~m - 1, 1);< 16821#$Ultimate##0 ~m := #in~m;~n := #in~n; 16823#L17 assume 0 == ~m;#res := 1 + ~n; 16971#ackermannFINAL assume true; 16968#ackermannEXIT >#43#return; 16969#L21-1 #res := #t~ret4;havoc #t~ret4; 16989#ackermannFINAL assume true; 16988#ackermannEXIT >#45#return; 16835#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16977#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16986#ackermannFINAL assume true; 16985#ackermannEXIT >#45#return; 16838#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16979#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 17012#ackermannFINAL assume true; 17010#ackermannEXIT >#45#return; 16836#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16978#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16984#ackermannFINAL assume true; 16981#ackermannEXIT >#45#return; 16839#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 16833#$Ultimate##0 ~m := #in~m;~n := #in~n; 16834#L17 assume 0 == ~m;#res := 1 + ~n; 16840#ackermannFINAL assume true; 16976#ackermannEXIT >#47#return; 16980#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 17007#ackermannFINAL assume true; 17003#ackermannEXIT >#47#return; 17001#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16999#ackermannFINAL assume true; 16996#ackermannEXIT >#47#return; 16994#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 16993#ackermannFINAL assume true; 16990#ackermannEXIT >#43#return; 16991#L21-1 #res := #t~ret4;havoc #t~ret4; 17002#ackermannFINAL assume true; 17000#ackermannEXIT >#45#return; 16897#L23-1 [2023-02-18 08:56:12,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:56:12,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1815337676, now seen corresponding path program 8 times [2023-02-18 08:56:12,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:56:12,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268215550] [2023-02-18 08:56:12,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:56:12,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:56:12,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:12,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-18 08:56:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:13,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:13,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:14,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:14,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:14,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:14,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:14,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:14,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:14,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:14,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:14,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:14,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:14,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:14,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:14,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-18 08:56:14,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:14,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:14,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:14,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:14,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:14,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:14,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:14,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:14,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:14,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:14,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:56:14,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:14,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:56:14,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:14,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-02-18 08:56:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:14,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:14,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:14,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:14,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:14,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:14,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:14,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:14,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:14,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:14,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:14,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:14,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:14,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:14,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:14,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:14,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-18 08:56:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:14,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:15,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:15,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:15,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:15,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:15,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:15,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:15,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:15,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:15,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:56:15,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:15,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:56:15,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:15,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-18 08:56:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:15,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:15,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:15,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:15,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:15,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:15,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:15,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:15,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:15,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:15,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:15,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:56:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:15,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:56:15,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:15,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:56:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:15,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2023-02-18 08:56:15,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:15,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:15,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:15,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:15,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:15,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:15,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:15,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:15,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:15,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:15,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:15,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:15,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:15,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:56:15,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:15,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:56:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:15,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:56:15,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:15,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2023-02-18 08:56:15,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:15,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:15,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:15,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:15,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:15,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:15,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:15,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:15,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:15,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:56:15,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:15,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:56:15,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:15,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:56:15,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:15,130 INFO L134 CoverageAnalysis]: Checked inductivity of 10185 backedges. 1021 proven. 2360 refuted. 0 times theorem prover too weak. 6804 trivial. 0 not checked. [2023-02-18 08:56:15,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:56:15,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268215550] [2023-02-18 08:56:15,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268215550] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 08:56:15,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540288294] [2023-02-18 08:56:15,131 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 08:56:15,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 08:56:15,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:56:15,137 INFO L229 MonitoredProcess]: Starting monitored process 161 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 08:56:15,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (161)] Waiting until timeout for monitored process [2023-02-18 08:56:15,527 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 08:56:15,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 08:56:15,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 1156 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-18 08:56:15,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:56:15,666 INFO L134 CoverageAnalysis]: Checked inductivity of 10185 backedges. 366 proven. 1883 refuted. 0 times theorem prover too weak. 7936 trivial. 0 not checked. [2023-02-18 08:56:15,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 08:56:16,147 INFO L134 CoverageAnalysis]: Checked inductivity of 10185 backedges. 366 proven. 1935 refuted. 0 times theorem prover too weak. 7884 trivial. 0 not checked. [2023-02-18 08:56:16,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540288294] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 08:56:16,150 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 08:56:16,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 12, 16] total 43 [2023-02-18 08:56:16,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229899454] [2023-02-18 08:56:16,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 08:56:16,151 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-18 08:56:16,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:56:16,153 INFO L85 PathProgramCache]: Analyzing trace with hash 41962951, now seen corresponding path program 6 times [2023-02-18 08:56:16,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:56:16,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199880869] [2023-02-18 08:56:16,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:56:16,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:56:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:16,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-18 08:56:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:17,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:17,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:17,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:17,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:17,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:17,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:18,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:18,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-18 08:56:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:18,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:18,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:18,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:18,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:18,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:56:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:56:18,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-02-18 08:56:18,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:18,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:18,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:18,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:18,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:18,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:18,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-18 08:56:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:18,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:18,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:18,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:56:18,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:56:18,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-18 08:56:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:18,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:18,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:18,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:18,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:56:18,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:56:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:56:18,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2023-02-18 08:56:18,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:18,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:18,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:18,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:18,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:56:18,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:56:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:56:18,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2023-02-18 08:56:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:18,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:18,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:18,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:18,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:56:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:56:18,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:56:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:18,766 INFO L134 CoverageAnalysis]: Checked inductivity of 10211 backedges. 1059 proven. 1993 refuted. 0 times theorem prover too weak. 7159 trivial. 0 not checked. [2023-02-18 08:56:18,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:56:18,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199880869] [2023-02-18 08:56:18,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199880869] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 08:56:18,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855904138] [2023-02-18 08:56:18,766 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-18 08:56:18,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 08:56:18,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:56:18,773 INFO L229 MonitoredProcess]: Starting monitored process 162 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 08:56:18,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (162)] Waiting until timeout for monitored process [2023-02-18 08:56:19,235 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2023-02-18 08:56:19,235 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 08:56:19,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 39 conjunts are in the unsatisfiable core [2023-02-18 08:56:19,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:56:19,365 INFO L134 CoverageAnalysis]: Checked inductivity of 10211 backedges. 1031 proven. 2007 refuted. 0 times theorem prover too weak. 7173 trivial. 0 not checked. [2023-02-18 08:56:19,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 08:56:20,253 INFO L134 CoverageAnalysis]: Checked inductivity of 10211 backedges. 1087 proven. 2011 refuted. 0 times theorem prover too weak. 7113 trivial. 0 not checked. [2023-02-18 08:56:20,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855904138] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 08:56:20,253 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 08:56:20,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 29] total 35 [2023-02-18 08:56:20,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238159041] [2023-02-18 08:56:20,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 08:56:20,255 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-18 08:56:20,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 08:56:20,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-18 08:56:20,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1023, Unknown=0, NotChecked=0, Total=1190 [2023-02-18 08:56:20,256 INFO L87 Difference]: Start difference. First operand 241 states and 318 transitions. cyclomatic complexity: 82 Second operand has 35 states, 31 states have (on average 2.225806451612903) internal successors, (69), 26 states have internal predecessors, (69), 17 states have call successors, (19), 1 states have call predecessors, (19), 18 states have return successors, (39), 17 states have call predecessors, (39), 17 states have call successors, (39) [2023-02-18 08:56:20,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 08:56:20,893 INFO L93 Difference]: Finished difference Result 307 states and 427 transitions. [2023-02-18 08:56:20,893 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 307 states and 427 transitions. [2023-02-18 08:56:20,897 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2023-02-18 08:56:20,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 307 states to 291 states and 401 transitions. [2023-02-18 08:56:20,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 242 [2023-02-18 08:56:20,902 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 242 [2023-02-18 08:56:20,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 291 states and 401 transitions. [2023-02-18 08:56:20,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-18 08:56:20,905 INFO L218 hiAutomatonCegarLoop]: Abstraction has 291 states and 401 transitions. [2023-02-18 08:56:20,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states and 401 transitions. [2023-02-18 08:56:20,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 257. [2023-02-18 08:56:20,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 160 states have (on average 1.04375) internal successors, (167), 164 states have internal predecessors, (167), 56 states have call successors, (59), 25 states have call predecessors, (59), 41 states have return successors, (120), 67 states have call predecessors, (120), 52 states have call successors, (120) [2023-02-18 08:56:20,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 346 transitions. [2023-02-18 08:56:20,915 INFO L240 hiAutomatonCegarLoop]: Abstraction has 257 states and 346 transitions. [2023-02-18 08:56:20,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-02-18 08:56:20,916 INFO L428 stractBuchiCegarLoop]: Abstraction has 257 states and 346 transitions. [2023-02-18 08:56:20,916 INFO L335 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2023-02-18 08:56:20,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 257 states and 346 transitions. [2023-02-18 08:56:20,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2023-02-18 08:56:20,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-18 08:56:20,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-18 08:56:20,926 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [88, 87, 50, 38, 38, 38, 38, 37, 37, 37, 12, 12, 12, 12, 1, 1, 1, 1, 1] [2023-02-18 08:56:20,926 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [88, 87, 50, 38, 38, 38, 38, 38, 37, 37, 12, 12, 12, 12] [2023-02-18 08:56:20,927 INFO L748 eck$LassoCheckResult]: Stem: 27780#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 27732#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 27729#L29 assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 27730#L33 assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); 27731#L36 call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1);< 27733#$Ultimate##0 ~m := #in~m;~n := #in~n; 27804#L17 assume !(0 == ~m); 27802#L20 assume !(0 == ~n); 27723#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27796#$Ultimate##0 ~m := #in~m;~n := #in~n; 27797#L17 assume !(0 == ~m); 27789#L20 assume 0 == ~n; 27790#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27800#$Ultimate##0 ~m := #in~m;~n := #in~n; 27798#L17 assume !(0 == ~m); 27795#L20 assume !(0 == ~n); 27788#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27792#$Ultimate##0 ~m := #in~m;~n := #in~n; 27791#L17 assume !(0 == ~m); 27786#L20 assume 0 == ~n; 27735#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27800#$Ultimate##0 ~m := #in~m;~n := #in~n; 27798#L17 assume !(0 == ~m); 27795#L20 assume !(0 == ~n); 27788#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27792#$Ultimate##0 ~m := #in~m;~n := #in~n; 27791#L17 assume !(0 == ~m); 27786#L20 assume 0 == ~n; 27735#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27800#$Ultimate##0 ~m := #in~m;~n := #in~n; 27798#L17 assume !(0 == ~m); 27795#L20 assume !(0 == ~n); 27788#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27792#$Ultimate##0 ~m := #in~m;~n := #in~n; 27791#L17 assume !(0 == ~m); 27786#L20 assume 0 == ~n; 27735#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27734#$Ultimate##0 ~m := #in~m;~n := #in~n; 27736#L17 assume 0 == ~m;#res := 1 + ~n; 27889#ackermannFINAL assume true; 27888#ackermannEXIT >#43#return; 27887#L21-1 #res := #t~ret4;havoc #t~ret4; 27886#ackermannFINAL assume true; 27883#ackermannEXIT >#45#return; 27869#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27870#$Ultimate##0 ~m := #in~m;~n := #in~n; 27876#L17 assume 0 == ~m;#res := 1 + ~n; 27874#ackermannFINAL assume true; 27868#ackermannEXIT >#47#return; 27866#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27864#ackermannFINAL assume true; 27861#ackermannEXIT >#43#return; 27860#L21-1 #res := #t~ret4;havoc #t~ret4; 27859#ackermannFINAL assume true; 27858#ackermannEXIT >#45#return; 27856#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27857#$Ultimate##0 ~m := #in~m;~n := #in~n; 27901#L17 assume !(0 == ~m); 27900#L20 assume !(0 == ~n); 27768#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27818#L17 assume !(0 == ~m); 27819#L20 assume 0 == ~n; 27765#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27769#$Ultimate##0 ~m := #in~m;~n := #in~n; 27882#L17 assume 0 == ~m;#res := 1 + ~n; 27881#ackermannFINAL assume true; 27879#ackermannEXIT >#43#return; 27880#L21-1 #res := #t~ret4;havoc #t~ret4; 27908#ackermannFINAL assume true; 27907#ackermannEXIT >#45#return; 27749#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27898#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27905#ackermannFINAL assume true; 27904#ackermannEXIT >#45#return; 27748#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27897#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27953#ackermannFINAL assume true; 27964#ackermannEXIT >#45#return; 27744#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27891#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27890#ackermannFINAL assume true; 27855#ackermannEXIT >#47#return; 27854#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27853#ackermannFINAL assume true; 27850#ackermannEXIT >#43#return; 27849#L21-1 #res := #t~ret4;havoc #t~ret4; 27846#ackermannFINAL assume true; 27843#ackermannEXIT >#45#return; 27844#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27915#$Ultimate##0 ~m := #in~m;~n := #in~n; 27931#L17 assume !(0 == ~m); 27929#L20 assume !(0 == ~n); 27756#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27779#$Ultimate##0 ~m := #in~m;~n := #in~n; 27828#L17 assume !(0 == ~m); 27754#L20 assume !(0 == ~n); 27755#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27779#$Ultimate##0 ~m := #in~m;~n := #in~n; 27828#L17 assume !(0 == ~m); 27754#L20 assume !(0 == ~n); 27755#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27779#$Ultimate##0 ~m := #in~m;~n := #in~n; 27828#L17 assume !(0 == ~m); 27754#L20 assume !(0 == ~n); 27755#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27779#$Ultimate##0 ~m := #in~m;~n := #in~n; 27828#L17 assume !(0 == ~m); 27754#L20 assume !(0 == ~n); 27755#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27779#$Ultimate##0 ~m := #in~m;~n := #in~n; 27827#L17 assume !(0 == ~m); 27826#L20 assume 0 == ~n; 27782#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27825#$Ultimate##0 ~m := #in~m;~n := #in~n; 27824#L17 assume !(0 == ~m); 27781#L20 assume !(0 == ~n); 27783#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27822#$Ultimate##0 ~m := #in~m;~n := #in~n; 27823#L17 assume !(0 == ~m); 27816#L20 assume 0 == ~n; 27817#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27769#$Ultimate##0 ~m := #in~m;~n := #in~n; 27882#L17 assume 0 == ~m;#res := 1 + ~n; 27881#ackermannFINAL assume true; 27879#ackermannEXIT >#43#return; 27878#L21-1 #res := #t~ret4;havoc #t~ret4; 27877#ackermannFINAL assume true; 27875#ackermannEXIT >#45#return; 27872#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27873#$Ultimate##0 ~m := #in~m;~n := #in~n; 27885#L17 assume 0 == ~m;#res := 1 + ~n; 27884#ackermannFINAL assume true; 27871#ackermannEXIT >#47#return; 27867#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27865#ackermannFINAL assume true; 27862#ackermannEXIT >#43#return; 27863#L21-1 #res := #t~ret4;havoc #t~ret4; 27960#ackermannFINAL assume true; 27958#ackermannEXIT >#45#return; 27758#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27832#$Ultimate##0 ~m := #in~m;~n := #in~n; 27833#L17 assume !(0 == ~m); 27906#L20 assume !(0 == ~n); 27767#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27818#L17 assume !(0 == ~m); 27819#L20 assume 0 == ~n; 27765#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27769#$Ultimate##0 ~m := #in~m;~n := #in~n; 27882#L17 assume 0 == ~m;#res := 1 + ~n; 27881#ackermannFINAL assume true; 27879#ackermannEXIT >#43#return; 27880#L21-1 #res := #t~ret4;havoc #t~ret4; 27908#ackermannFINAL assume true; 27907#ackermannEXIT >#45#return; 27749#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27898#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27905#ackermannFINAL assume true; 27904#ackermannEXIT >#45#return; 27748#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27897#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27953#ackermannFINAL assume true; 27964#ackermannEXIT >#45#return; 27746#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27895#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27902#ackermannFINAL assume true; 27899#ackermannEXIT >#45#return; 27743#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27893#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27903#ackermannFINAL assume true; 27933#ackermannEXIT >#45#return; 27745#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27894#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27927#ackermannFINAL assume true; 27921#ackermannEXIT >#47#return; 27922#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27961#ackermannFINAL assume true; 27959#ackermannEXIT >#45#return; 27759#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27832#$Ultimate##0 ~m := #in~m;~n := #in~n; 27833#L17 assume !(0 == ~m); 27906#L20 assume !(0 == ~n); 27767#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27818#L17 assume !(0 == ~m); 27819#L20 assume 0 == ~n; 27765#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27769#$Ultimate##0 ~m := #in~m;~n := #in~n; 27882#L17 assume 0 == ~m;#res := 1 + ~n; 27881#ackermannFINAL assume true; 27879#ackermannEXIT >#43#return; 27880#L21-1 #res := #t~ret4;havoc #t~ret4; 27908#ackermannFINAL assume true; 27907#ackermannEXIT >#45#return; 27749#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27898#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27905#ackermannFINAL assume true; 27904#ackermannEXIT >#45#return; 27748#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27897#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27953#ackermannFINAL assume true; 27964#ackermannEXIT >#45#return; 27746#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27895#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27902#ackermannFINAL assume true; 27899#ackermannEXIT >#45#return; 27743#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27893#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27903#ackermannFINAL assume true; 27933#ackermannEXIT >#45#return; 27745#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27894#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27927#ackermannFINAL assume true; 27921#ackermannEXIT >#47#return; 27923#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27957#ackermannFINAL assume true; 27956#ackermannEXIT >#45#return; 27763#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27832#$Ultimate##0 ~m := #in~m;~n := #in~n; 27833#L17 assume !(0 == ~m); 27906#L20 assume !(0 == ~n); 27767#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27818#L17 assume !(0 == ~m); 27819#L20 assume 0 == ~n; 27765#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27769#$Ultimate##0 ~m := #in~m;~n := #in~n; 27882#L17 assume 0 == ~m;#res := 1 + ~n; 27881#ackermannFINAL assume true; 27879#ackermannEXIT >#43#return; 27880#L21-1 #res := #t~ret4;havoc #t~ret4; 27908#ackermannFINAL assume true; 27907#ackermannEXIT >#45#return; 27749#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27898#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27905#ackermannFINAL assume true; 27904#ackermannEXIT >#45#return; 27748#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27897#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27953#ackermannFINAL assume true; 27964#ackermannEXIT >#45#return; 27746#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27895#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27902#ackermannFINAL assume true; 27899#ackermannEXIT >#45#return; 27743#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27893#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27903#ackermannFINAL assume true; 27933#ackermannEXIT >#45#return; 27745#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27894#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27927#ackermannFINAL assume true; 27921#ackermannEXIT >#47#return; 27926#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27955#ackermannFINAL assume true; 27954#ackermannEXIT >#45#return; 27760#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27832#$Ultimate##0 ~m := #in~m;~n := #in~n; 27833#L17 assume !(0 == ~m); 27906#L20 assume !(0 == ~n); 27767#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27818#L17 assume !(0 == ~m); 27819#L20 assume 0 == ~n; 27765#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27769#$Ultimate##0 ~m := #in~m;~n := #in~n; 27882#L17 assume 0 == ~m;#res := 1 + ~n; 27881#ackermannFINAL assume true; 27879#ackermannEXIT >#43#return; 27880#L21-1 #res := #t~ret4;havoc #t~ret4; 27908#ackermannFINAL assume true; 27907#ackermannEXIT >#45#return; 27749#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27898#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27905#ackermannFINAL assume true; 27904#ackermannEXIT >#45#return; 27748#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27897#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27953#ackermannFINAL assume true; 27964#ackermannEXIT >#45#return; 27746#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27895#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27902#ackermannFINAL assume true; 27899#ackermannEXIT >#45#return; 27743#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27893#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27903#ackermannFINAL assume true; 27933#ackermannEXIT >#45#return; 27745#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27894#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27927#ackermannFINAL assume true; 27921#ackermannEXIT >#47#return; 27924#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27952#ackermannFINAL assume true; 27928#ackermannEXIT >#45#return; 27762#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27832#$Ultimate##0 ~m := #in~m;~n := #in~n; 27833#L17 assume !(0 == ~m); 27906#L20 assume !(0 == ~n); 27767#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27818#L17 assume !(0 == ~m); 27819#L20 assume 0 == ~n; 27765#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27769#$Ultimate##0 ~m := #in~m;~n := #in~n; 27882#L17 assume 0 == ~m;#res := 1 + ~n; 27881#ackermannFINAL assume true; 27879#ackermannEXIT >#43#return; 27880#L21-1 #res := #t~ret4;havoc #t~ret4; 27908#ackermannFINAL assume true; 27907#ackermannEXIT >#45#return; 27749#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27898#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27905#ackermannFINAL assume true; 27904#ackermannEXIT >#45#return; 27748#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27897#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27953#ackermannFINAL assume true; 27964#ackermannEXIT >#45#return; 27746#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27895#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27902#ackermannFINAL assume true; 27899#ackermannEXIT >#45#return; 27743#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27893#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27903#ackermannFINAL assume true; 27933#ackermannEXIT >#45#return; 27745#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27894#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27927#ackermannFINAL assume true; 27921#ackermannEXIT >#47#return; 27919#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27917#ackermannFINAL assume true; 27913#ackermannEXIT >#47#return; 27912#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27911#ackermannFINAL assume true; 27909#ackermannEXIT >#43#return; 27774#L21-1 #res := #t~ret4;havoc #t~ret4; 27722#ackermannFINAL assume true; 27728#ackermannEXIT >#45#return; 27740#L23-1 [2023-02-18 08:56:20,928 INFO L750 eck$LassoCheckResult]: Loop: 27740#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27831#$Ultimate##0 ~m := #in~m;~n := #in~n; 27842#L17 assume !(0 == ~m); 27950#L20 assume !(0 == ~n); 27724#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27737#$Ultimate##0 ~m := #in~m;~n := #in~n; 27739#L17 assume !(0 == ~m); 27752#L20 assume 0 == ~n; 27753#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27813#$Ultimate##0 ~m := #in~m;~n := #in~n; 27784#L17 assume !(0 == ~m); 27785#L20 assume !(0 == ~n); 27775#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27778#$Ultimate##0 ~m := #in~m;~n := #in~n; 27830#L17 assume !(0 == ~m); 27852#L20 assume 0 == ~n; 27777#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27805#$Ultimate##0 ~m := #in~m;~n := #in~n; 27806#L17 assume !(0 == ~m); 27785#L20 assume !(0 == ~n); 27775#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27778#$Ultimate##0 ~m := #in~m;~n := #in~n; 27830#L17 assume !(0 == ~m); 27852#L20 assume 0 == ~n; 27777#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27805#$Ultimate##0 ~m := #in~m;~n := #in~n; 27806#L17 assume !(0 == ~m); 27785#L20 assume !(0 == ~n); 27775#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27778#$Ultimate##0 ~m := #in~m;~n := #in~n; 27830#L17 assume !(0 == ~m); 27852#L20 assume 0 == ~n; 27777#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27805#$Ultimate##0 ~m := #in~m;~n := #in~n; 27806#L17 assume 0 == ~m;#res := 1 + ~n; 27881#ackermannFINAL assume true; 27879#ackermannEXIT >#43#return; 27878#L21-1 #res := #t~ret4;havoc #t~ret4; 27877#ackermannFINAL assume true; 27875#ackermannEXIT >#45#return; 27872#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27873#$Ultimate##0 ~m := #in~m;~n := #in~n; 27885#L17 assume 0 == ~m;#res := 1 + ~n; 27884#ackermannFINAL assume true; 27871#ackermannEXIT >#47#return; 27867#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27865#ackermannFINAL assume true; 27862#ackermannEXIT >#43#return; 27860#L21-1 #res := #t~ret4;havoc #t~ret4; 27859#ackermannFINAL assume true; 27858#ackermannEXIT >#45#return; 27856#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27857#$Ultimate##0 ~m := #in~m;~n := #in~n; 27901#L17 assume !(0 == ~m); 27900#L20 assume !(0 == ~n); 27768#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27818#L17 assume !(0 == ~m); 27819#L20 assume 0 == ~n; 27765#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27769#$Ultimate##0 ~m := #in~m;~n := #in~n; 27882#L17 assume 0 == ~m;#res := 1 + ~n; 27881#ackermannFINAL assume true; 27879#ackermannEXIT >#43#return; 27880#L21-1 #res := #t~ret4;havoc #t~ret4; 27908#ackermannFINAL assume true; 27907#ackermannEXIT >#45#return; 27749#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27898#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27905#ackermannFINAL assume true; 27904#ackermannEXIT >#45#return; 27748#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27897#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27953#ackermannFINAL assume true; 27964#ackermannEXIT >#45#return; 27744#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27891#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27890#ackermannFINAL assume true; 27855#ackermannEXIT >#47#return; 27854#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27853#ackermannFINAL assume true; 27850#ackermannEXIT >#43#return; 27849#L21-1 #res := #t~ret4;havoc #t~ret4; 27846#ackermannFINAL assume true; 27843#ackermannEXIT >#45#return; 27844#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27915#$Ultimate##0 ~m := #in~m;~n := #in~n; 27931#L17 assume !(0 == ~m); 27929#L20 assume !(0 == ~n); 27756#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27779#$Ultimate##0 ~m := #in~m;~n := #in~n; 27828#L17 assume !(0 == ~m); 27754#L20 assume !(0 == ~n); 27755#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27779#$Ultimate##0 ~m := #in~m;~n := #in~n; 27828#L17 assume !(0 == ~m); 27754#L20 assume !(0 == ~n); 27755#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27779#$Ultimate##0 ~m := #in~m;~n := #in~n; 27828#L17 assume !(0 == ~m); 27754#L20 assume !(0 == ~n); 27755#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27779#$Ultimate##0 ~m := #in~m;~n := #in~n; 27828#L17 assume !(0 == ~m); 27754#L20 assume !(0 == ~n); 27755#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27779#$Ultimate##0 ~m := #in~m;~n := #in~n; 27827#L17 assume !(0 == ~m); 27826#L20 assume 0 == ~n; 27782#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27825#$Ultimate##0 ~m := #in~m;~n := #in~n; 27824#L17 assume !(0 == ~m); 27781#L20 assume !(0 == ~n); 27783#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27822#$Ultimate##0 ~m := #in~m;~n := #in~n; 27823#L17 assume !(0 == ~m); 27816#L20 assume 0 == ~n; 27817#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27769#$Ultimate##0 ~m := #in~m;~n := #in~n; 27882#L17 assume 0 == ~m;#res := 1 + ~n; 27881#ackermannFINAL assume true; 27879#ackermannEXIT >#43#return; 27878#L21-1 #res := #t~ret4;havoc #t~ret4; 27877#ackermannFINAL assume true; 27875#ackermannEXIT >#45#return; 27872#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27873#$Ultimate##0 ~m := #in~m;~n := #in~n; 27885#L17 assume 0 == ~m;#res := 1 + ~n; 27884#ackermannFINAL assume true; 27871#ackermannEXIT >#47#return; 27867#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27865#ackermannFINAL assume true; 27862#ackermannEXIT >#43#return; 27863#L21-1 #res := #t~ret4;havoc #t~ret4; 27960#ackermannFINAL assume true; 27958#ackermannEXIT >#45#return; 27758#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27832#$Ultimate##0 ~m := #in~m;~n := #in~n; 27833#L17 assume !(0 == ~m); 27906#L20 assume !(0 == ~n); 27767#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27818#L17 assume !(0 == ~m); 27819#L20 assume 0 == ~n; 27765#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27769#$Ultimate##0 ~m := #in~m;~n := #in~n; 27882#L17 assume 0 == ~m;#res := 1 + ~n; 27881#ackermannFINAL assume true; 27879#ackermannEXIT >#43#return; 27880#L21-1 #res := #t~ret4;havoc #t~ret4; 27908#ackermannFINAL assume true; 27907#ackermannEXIT >#45#return; 27749#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27898#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27905#ackermannFINAL assume true; 27904#ackermannEXIT >#45#return; 27748#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27897#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27953#ackermannFINAL assume true; 27964#ackermannEXIT >#45#return; 27746#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27895#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27902#ackermannFINAL assume true; 27899#ackermannEXIT >#45#return; 27743#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27893#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27903#ackermannFINAL assume true; 27933#ackermannEXIT >#45#return; 27745#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27894#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27927#ackermannFINAL assume true; 27921#ackermannEXIT >#47#return; 27922#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27961#ackermannFINAL assume true; 27959#ackermannEXIT >#45#return; 27759#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27832#$Ultimate##0 ~m := #in~m;~n := #in~n; 27833#L17 assume !(0 == ~m); 27906#L20 assume !(0 == ~n); 27767#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27818#L17 assume !(0 == ~m); 27819#L20 assume 0 == ~n; 27765#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27769#$Ultimate##0 ~m := #in~m;~n := #in~n; 27882#L17 assume 0 == ~m;#res := 1 + ~n; 27881#ackermannFINAL assume true; 27879#ackermannEXIT >#43#return; 27880#L21-1 #res := #t~ret4;havoc #t~ret4; 27908#ackermannFINAL assume true; 27907#ackermannEXIT >#45#return; 27749#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27898#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27905#ackermannFINAL assume true; 27904#ackermannEXIT >#45#return; 27748#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27897#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27953#ackermannFINAL assume true; 27964#ackermannEXIT >#45#return; 27746#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27895#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27902#ackermannFINAL assume true; 27899#ackermannEXIT >#45#return; 27743#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27893#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27903#ackermannFINAL assume true; 27933#ackermannEXIT >#45#return; 27745#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27894#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27927#ackermannFINAL assume true; 27921#ackermannEXIT >#47#return; 27923#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27957#ackermannFINAL assume true; 27956#ackermannEXIT >#45#return; 27763#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27832#$Ultimate##0 ~m := #in~m;~n := #in~n; 27833#L17 assume !(0 == ~m); 27906#L20 assume !(0 == ~n); 27767#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27818#L17 assume !(0 == ~m); 27819#L20 assume 0 == ~n; 27765#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27769#$Ultimate##0 ~m := #in~m;~n := #in~n; 27882#L17 assume 0 == ~m;#res := 1 + ~n; 27881#ackermannFINAL assume true; 27879#ackermannEXIT >#43#return; 27880#L21-1 #res := #t~ret4;havoc #t~ret4; 27908#ackermannFINAL assume true; 27907#ackermannEXIT >#45#return; 27749#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27898#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27905#ackermannFINAL assume true; 27904#ackermannEXIT >#45#return; 27748#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27897#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27953#ackermannFINAL assume true; 27964#ackermannEXIT >#45#return; 27746#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27895#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27902#ackermannFINAL assume true; 27899#ackermannEXIT >#45#return; 27743#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27893#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27903#ackermannFINAL assume true; 27933#ackermannEXIT >#45#return; 27745#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27894#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27927#ackermannFINAL assume true; 27921#ackermannEXIT >#47#return; 27926#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27955#ackermannFINAL assume true; 27954#ackermannEXIT >#45#return; 27760#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27832#$Ultimate##0 ~m := #in~m;~n := #in~n; 27833#L17 assume !(0 == ~m); 27906#L20 assume !(0 == ~n); 27767#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27818#L17 assume !(0 == ~m); 27819#L20 assume 0 == ~n; 27765#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27769#$Ultimate##0 ~m := #in~m;~n := #in~n; 27882#L17 assume 0 == ~m;#res := 1 + ~n; 27881#ackermannFINAL assume true; 27879#ackermannEXIT >#43#return; 27880#L21-1 #res := #t~ret4;havoc #t~ret4; 27908#ackermannFINAL assume true; 27907#ackermannEXIT >#45#return; 27749#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27898#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27905#ackermannFINAL assume true; 27904#ackermannEXIT >#45#return; 27748#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27897#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27953#ackermannFINAL assume true; 27964#ackermannEXIT >#45#return; 27746#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27895#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27902#ackermannFINAL assume true; 27899#ackermannEXIT >#45#return; 27743#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27893#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27903#ackermannFINAL assume true; 27933#ackermannEXIT >#45#return; 27745#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27894#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27927#ackermannFINAL assume true; 27921#ackermannEXIT >#47#return; 27924#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27952#ackermannFINAL assume true; 27928#ackermannEXIT >#45#return; 27762#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27832#$Ultimate##0 ~m := #in~m;~n := #in~n; 27833#L17 assume !(0 == ~m); 27906#L20 assume !(0 == ~n); 27767#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27821#L17 assume !(0 == ~m); 27829#L20 assume !(0 == ~n); 27766#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 27820#$Ultimate##0 ~m := #in~m;~n := #in~n; 27818#L17 assume !(0 == ~m); 27819#L20 assume 0 == ~n; 27765#L21 call #t~ret4 := ackermann(~m - 1, 1);< 27769#$Ultimate##0 ~m := #in~m;~n := #in~n; 27882#L17 assume 0 == ~m;#res := 1 + ~n; 27881#ackermannFINAL assume true; 27879#ackermannEXIT >#43#return; 27880#L21-1 #res := #t~ret4;havoc #t~ret4; 27908#ackermannFINAL assume true; 27907#ackermannEXIT >#45#return; 27749#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27898#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27905#ackermannFINAL assume true; 27904#ackermannEXIT >#45#return; 27748#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27897#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27953#ackermannFINAL assume true; 27964#ackermannEXIT >#45#return; 27746#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27895#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27902#ackermannFINAL assume true; 27899#ackermannEXIT >#45#return; 27743#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27893#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27903#ackermannFINAL assume true; 27933#ackermannEXIT >#45#return; 27745#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 27764#$Ultimate##0 ~m := #in~m;~n := #in~n; 27742#L17 assume 0 == ~m;#res := 1 + ~n; 27750#ackermannFINAL assume true; 27892#ackermannEXIT >#47#return; 27894#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27927#ackermannFINAL assume true; 27921#ackermannEXIT >#47#return; 27919#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27917#ackermannFINAL assume true; 27913#ackermannEXIT >#47#return; 27912#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 27911#ackermannFINAL assume true; 27909#ackermannEXIT >#43#return; 27774#L21-1 #res := #t~ret4;havoc #t~ret4; 27722#ackermannFINAL assume true; 27728#ackermannEXIT >#45#return; 27740#L23-1 [2023-02-18 08:56:20,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:56:20,928 INFO L85 PathProgramCache]: Analyzing trace with hash 301299634, now seen corresponding path program 9 times [2023-02-18 08:56:20,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:56:20,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730631147] [2023-02-18 08:56:20,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:56:20,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:56:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:21,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-18 08:56:21,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:21,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:22,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:22,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:22,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:22,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:22,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:22,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:22,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:22,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:22,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:22,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-18 08:56:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:22,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:22,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:22,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:22,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:22,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:22,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:22,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:22,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:22,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:22,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:56:22,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:22,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:56:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:22,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-02-18 08:56:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:22,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:22,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:22,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:22,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:22,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:22,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:22,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:22,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:22,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:22,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:22,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:22,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:22,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:22,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:22,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:22,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:22,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-18 08:56:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:23,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:23,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:23,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:23,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:23,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:56:23,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:56:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:56:23,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:56:23,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-02-18 08:56:23,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:23,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:23,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:23,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:23,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:56:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:56:23,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:56:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:56:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2023-02-18 08:56:23,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:23,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:23,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:23,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:23,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:56:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:56:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:56:23,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:56:23,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2023-02-18 08:56:23,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:23,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:23,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:23,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:23,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:23,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:56:23,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:56:23,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:56:23,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:56:23,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2023-02-18 08:56:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:23,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:23,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:23,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:23,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:23,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:56:23,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:56:23,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:56:23,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:56:23,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:23,238 INFO L134 CoverageAnalysis]: Checked inductivity of 18530 backedges. 453 proven. 2429 refuted. 0 times theorem prover too weak. 15648 trivial. 0 not checked. [2023-02-18 08:56:23,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:56:23,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730631147] [2023-02-18 08:56:23,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730631147] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 08:56:23,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726717883] [2023-02-18 08:56:23,239 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 08:56:23,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 08:56:23,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:56:23,242 INFO L229 MonitoredProcess]: Starting monitored process 163 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 08:56:23,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (163)] Waiting until timeout for monitored process [2023-02-18 08:56:23,762 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2023-02-18 08:56:23,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 08:56:23,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 51 conjunts are in the unsatisfiable core [2023-02-18 08:56:23,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:56:24,167 INFO L134 CoverageAnalysis]: Checked inductivity of 18530 backedges. 4786 proven. 609 refuted. 0 times theorem prover too weak. 13135 trivial. 0 not checked. [2023-02-18 08:56:24,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 08:56:26,413 INFO L134 CoverageAnalysis]: Checked inductivity of 18530 backedges. 4876 proven. 635 refuted. 0 times theorem prover too weak. 13019 trivial. 0 not checked. [2023-02-18 08:56:26,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726717883] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 08:56:26,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 08:56:26,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 28, 39] total 57 [2023-02-18 08:56:26,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991116480] [2023-02-18 08:56:26,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 08:56:26,415 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-18 08:56:26,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:56:26,415 INFO L85 PathProgramCache]: Analyzing trace with hash -2130492481, now seen corresponding path program 7 times [2023-02-18 08:56:26,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:56:26,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526987713] [2023-02-18 08:56:26,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:56:26,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:56:26,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:29,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-18 08:56:29,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:32,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:32,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:34,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:34,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:34,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:34,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:34,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:34,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:34,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:34,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:34,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:34,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:34,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:34,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:34,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:34,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:34,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-18 08:56:34,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:34,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:34,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:34,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:34,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:34,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:34,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:34,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:34,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:34,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:56:34,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:34,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:56:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:34,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-02-18 08:56:34,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:36,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:36,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:38,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:38,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:38,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:38,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:39,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:39,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:39,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:39,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:39,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:39,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:39,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:39,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:39,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:39,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:39,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:39,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-18 08:56:39,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:39,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:39,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:39,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:39,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:39,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:39,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:39,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:39,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:39,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:39,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:39,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:39,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:56:39,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:39,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:56:39,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:39,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:56:39,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:39,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:56:39,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:39,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-02-18 08:56:39,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:39,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:39,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:39,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:39,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:39,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:39,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:39,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:39,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:39,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:39,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:39,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:39,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:56:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:39,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:56:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:39,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:56:39,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:39,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:56:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:39,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2023-02-18 08:56:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:39,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:39,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:39,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:39,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:39,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:39,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:39,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:39,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:39,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:39,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:39,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:56:39,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:39,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:56:39,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:39,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:56:39,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:39,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:56:39,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:39,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2023-02-18 08:56:39,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:39,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:39,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:39,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:40,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:40,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:40,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:40,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:40,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:40,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:40,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:40,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:40,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:56:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:40,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:56:40,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:40,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:56:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:40,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:56:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:40,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2023-02-18 08:56:40,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:40,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:40,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:40,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:40,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:40,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:40,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:40,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:40,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:40,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:40,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:40,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:40,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:40,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:56:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:40,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:56:40,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:40,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:56:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:40,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:56:40,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:40,231 INFO L134 CoverageAnalysis]: Checked inductivity of 18567 backedges. 5933 proven. 3541 refuted. 0 times theorem prover too weak. 9093 trivial. 0 not checked. [2023-02-18 08:56:40,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:56:40,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526987713] [2023-02-18 08:56:40,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526987713] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 08:56:40,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606075563] [2023-02-18 08:56:40,233 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-18 08:56:40,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 08:56:40,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:56:40,237 INFO L229 MonitoredProcess]: Starting monitored process 164 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 08:56:40,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (164)] Waiting until timeout for monitored process [2023-02-18 08:56:40,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:40,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 1505 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-18 08:56:40,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:56:41,077 INFO L134 CoverageAnalysis]: Checked inductivity of 18567 backedges. 9946 proven. 233 refuted. 0 times theorem prover too weak. 8388 trivial. 0 not checked. [2023-02-18 08:56:41,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 08:56:41,952 INFO L134 CoverageAnalysis]: Checked inductivity of 18567 backedges. 2046 proven. 2567 refuted. 0 times theorem prover too weak. 13954 trivial. 0 not checked. [2023-02-18 08:56:41,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606075563] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 08:56:41,953 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 08:56:41,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 17, 24] total 43 [2023-02-18 08:56:41,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232898599] [2023-02-18 08:56:41,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 08:56:41,955 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-18 08:56:41,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 08:56:41,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-02-18 08:56:41,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1607, Unknown=0, NotChecked=0, Total=1806 [2023-02-18 08:56:41,956 INFO L87 Difference]: Start difference. First operand 257 states and 346 transitions. cyclomatic complexity: 94 Second operand has 43 states, 36 states have (on average 2.361111111111111) internal successors, (85), 31 states have internal predecessors, (85), 28 states have call successors, (33), 2 states have call predecessors, (33), 21 states have return successors, (62), 26 states have call predecessors, (62), 28 states have call successors, (62) [2023-02-18 08:56:42,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 08:56:42,808 INFO L93 Difference]: Finished difference Result 354 states and 525 transitions. [2023-02-18 08:56:42,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 354 states and 525 transitions. [2023-02-18 08:56:42,814 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2023-02-18 08:56:42,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 354 states to 343 states and 507 transitions. [2023-02-18 08:56:42,820 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 282 [2023-02-18 08:56:42,821 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 297 [2023-02-18 08:56:42,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 343 states and 507 transitions. [2023-02-18 08:56:42,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-18 08:56:42,821 INFO L218 hiAutomatonCegarLoop]: Abstraction has 343 states and 507 transitions. [2023-02-18 08:56:42,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states and 507 transitions. [2023-02-18 08:56:42,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 282. [2023-02-18 08:56:42,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 179 states have (on average 1.0391061452513966) internal successors, (186), 182 states have internal predecessors, (186), 59 states have call successors, (62), 32 states have call predecessors, (62), 44 states have return successors, (118), 67 states have call predecessors, (118), 55 states have call successors, (118) [2023-02-18 08:56:42,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 366 transitions. [2023-02-18 08:56:42,832 INFO L240 hiAutomatonCegarLoop]: Abstraction has 282 states and 366 transitions. [2023-02-18 08:56:42,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-02-18 08:56:42,833 INFO L428 stractBuchiCegarLoop]: Abstraction has 282 states and 366 transitions. [2023-02-18 08:56:42,833 INFO L335 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2023-02-18 08:56:42,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 282 states and 366 transitions. [2023-02-18 08:56:42,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2023-02-18 08:56:42,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-18 08:56:42,836 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-18 08:56:42,873 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [84, 83, 48, 36, 36, 36, 36, 35, 35, 35, 12, 12, 12, 12, 1, 1, 1, 1, 1] [2023-02-18 08:56:42,873 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1341, 1340, 747, 594, 594, 594, 594, 594, 593, 593, 153, 153, 153, 153] [2023-02-18 08:56:42,874 INFO L748 eck$LassoCheckResult]: Stem: 43394#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 43350#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;main_~m~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 43347#L29 assume !(main_~m~0#1 < 0 || main_~m~0#1 > 3);main_~n~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 43348#L33 assume !(main_~n~0#1 < 0 || main_~n~0#1 > 23); 43349#L36 call main_#t~ret9#1 := ackermann(main_~m~0#1, main_~n~0#1);< 43351#$Ultimate##0 ~m := #in~m;~n := #in~n; 43412#L17 assume !(0 == ~m); 43410#L20 assume !(0 == ~n); 43388#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43405#$Ultimate##0 ~m := #in~m;~n := #in~n; 43406#L17 assume !(0 == ~m); 43449#L20 assume 0 == ~n; 43404#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43447#$Ultimate##0 ~m := #in~m;~n := #in~n; 43407#L17 assume !(0 == ~m); 43403#L20 assume !(0 == ~n); 43397#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43401#$Ultimate##0 ~m := #in~m;~n := #in~n; 43400#L17 assume !(0 == ~m); 43395#L20 assume 0 == ~n; 43398#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43447#$Ultimate##0 ~m := #in~m;~n := #in~n; 43407#L17 assume !(0 == ~m); 43403#L20 assume !(0 == ~n); 43397#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43401#$Ultimate##0 ~m := #in~m;~n := #in~n; 43400#L17 assume !(0 == ~m); 43395#L20 assume 0 == ~n; 43398#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43447#$Ultimate##0 ~m := #in~m;~n := #in~n; 43407#L17 assume !(0 == ~m); 43403#L20 assume !(0 == ~n); 43397#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43401#$Ultimate##0 ~m := #in~m;~n := #in~n; 43400#L17 assume !(0 == ~m); 43395#L20 assume 0 == ~n; 43398#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43446#$Ultimate##0 ~m := #in~m;~n := #in~n; 43490#L17 assume 0 == ~m;#res := 1 + ~n; 43488#ackermannFINAL assume true; 43487#ackermannEXIT >#43#return; 43485#L21-1 #res := #t~ret4;havoc #t~ret4; 43483#ackermannFINAL assume true; 43482#ackermannEXIT >#45#return; 43480#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43481#$Ultimate##0 ~m := #in~m;~n := #in~n; 43486#L17 assume 0 == ~m;#res := 1 + ~n; 43484#ackermannFINAL assume true; 43479#ackermannEXIT >#47#return; 43477#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43476#ackermannFINAL assume true; 43444#ackermannEXIT >#43#return; 43442#L21-1 #res := #t~ret4;havoc #t~ret4; 43436#ackermannFINAL assume true; 43430#ackermannEXIT >#45#return; 43415#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43418#$Ultimate##0 ~m := #in~m;~n := #in~n; 43417#L17 assume !(0 == ~m); 43414#L20 assume !(0 == ~n); 43416#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43538#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43533#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43530#ackermannFINAL assume true; 43527#ackermannEXIT >#47#return; 43525#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43523#ackermannFINAL assume true; 43518#ackermannEXIT >#43#return; 43519#L21-1 #res := #t~ret4;havoc #t~ret4; 43534#ackermannFINAL assume true; 43531#ackermannEXIT >#45#return; 43502#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43509#$Ultimate##0 ~m := #in~m;~n := #in~n; 43508#L17 assume !(0 == ~m); 43501#L20 assume !(0 == ~n); 43424#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43464#L17 assume !(0 == ~m); 43461#L20 assume 0 == ~n; 43441#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43460#$Ultimate##0 ~m := #in~m;~n := #in~n; 43459#L17 assume !(0 == ~m); 43457#L20 assume !(0 == ~n); 43428#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43455#$Ultimate##0 ~m := #in~m;~n := #in~n; 43500#L17 assume !(0 == ~m); 43427#L20 assume 0 == ~n; 43429#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43439#L21-1 #res := #t~ret4;havoc #t~ret4; 43437#ackermannFINAL assume true; 43432#ackermannEXIT >#45#return; 43421#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43426#$Ultimate##0 ~m := #in~m;~n := #in~n; 43547#L17 assume !(0 == ~m); 43546#L20 assume !(0 == ~n); 43420#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43536#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43539#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43603#ackermannFINAL assume true; 43602#ackermannEXIT >#47#return; 43601#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43599#ackermannFINAL assume true; 43600#ackermannEXIT >#45#return; 43366#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43571#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43604#ackermannFINAL assume true; 43598#ackermannEXIT >#45#return; 43367#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43572#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43606#ackermannFINAL assume true; 43605#ackermannEXIT >#45#return; 43368#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43573#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43597#ackermannFINAL assume true; 43584#ackermannEXIT >#45#return; 43364#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43567#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43565#ackermannFINAL assume true; 43528#ackermannEXIT >#47#return; 43526#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43524#ackermannFINAL assume true; 43520#ackermannEXIT >#43#return; 43522#L21-1 #res := #t~ret4;havoc #t~ret4; 43615#ackermannFINAL assume true; 43614#ackermannEXIT >#45#return; 43372#L23-1 [2023-02-18 08:56:42,879 INFO L750 eck$LassoCheckResult]: Loop: 43372#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43517#$Ultimate##0 ~m := #in~m;~n := #in~n; 43512#L17 assume !(0 == ~m); 43513#L20 assume !(0 == ~n); 43344#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43465#L17 assume !(0 == ~m); 43462#L20 assume 0 == ~n; 43433#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43419#$Ultimate##0 ~m := #in~m;~n := #in~n; 43478#L17 assume !(0 == ~m); 43443#L20 assume !(0 == ~n); 43431#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43435#$Ultimate##0 ~m := #in~m;~n := #in~n; 43491#L17 assume !(0 == ~m); 43489#L20 assume 0 == ~n; 43434#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43445#$Ultimate##0 ~m := #in~m;~n := #in~n; 43498#L17 assume !(0 == ~m); 43443#L20 assume !(0 == ~n); 43431#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43435#$Ultimate##0 ~m := #in~m;~n := #in~n; 43491#L17 assume !(0 == ~m); 43489#L20 assume 0 == ~n; 43434#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43445#$Ultimate##0 ~m := #in~m;~n := #in~n; 43498#L17 assume !(0 == ~m); 43443#L20 assume !(0 == ~n); 43431#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43435#$Ultimate##0 ~m := #in~m;~n := #in~n; 43491#L17 assume !(0 == ~m); 43489#L20 assume 0 == ~n; 43434#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43445#$Ultimate##0 ~m := #in~m;~n := #in~n; 43498#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43442#L21-1 #res := #t~ret4;havoc #t~ret4; 43436#ackermannFINAL assume true; 43430#ackermannEXIT >#45#return; 43415#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43418#$Ultimate##0 ~m := #in~m;~n := #in~n; 43417#L17 assume !(0 == ~m); 43414#L20 assume !(0 == ~n); 43416#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43538#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43533#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43530#ackermannFINAL assume true; 43527#ackermannEXIT >#47#return; 43525#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43523#ackermannFINAL assume true; 43518#ackermannEXIT >#43#return; 43519#L21-1 #res := #t~ret4;havoc #t~ret4; 43534#ackermannFINAL assume true; 43531#ackermannEXIT >#45#return; 43502#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43509#$Ultimate##0 ~m := #in~m;~n := #in~n; 43508#L17 assume !(0 == ~m); 43501#L20 assume !(0 == ~n); 43424#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43464#L17 assume !(0 == ~m); 43461#L20 assume 0 == ~n; 43441#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43460#$Ultimate##0 ~m := #in~m;~n := #in~n; 43459#L17 assume !(0 == ~m); 43457#L20 assume !(0 == ~n); 43428#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43455#$Ultimate##0 ~m := #in~m;~n := #in~n; 43500#L17 assume !(0 == ~m); 43427#L20 assume 0 == ~n; 43429#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43439#L21-1 #res := #t~ret4;havoc #t~ret4; 43437#ackermannFINAL assume true; 43432#ackermannEXIT >#45#return; 43421#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43426#$Ultimate##0 ~m := #in~m;~n := #in~n; 43547#L17 assume !(0 == ~m); 43546#L20 assume !(0 == ~n); 43420#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43536#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43539#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43603#ackermannFINAL assume true; 43602#ackermannEXIT >#47#return; 43601#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43599#ackermannFINAL assume true; 43600#ackermannEXIT >#45#return; 43366#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43571#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43604#ackermannFINAL assume true; 43598#ackermannEXIT >#45#return; 43367#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43572#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43606#ackermannFINAL assume true; 43605#ackermannEXIT >#45#return; 43368#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43573#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43597#ackermannFINAL assume true; 43584#ackermannEXIT >#45#return; 43364#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43567#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43565#ackermannFINAL assume true; 43528#ackermannEXIT >#47#return; 43526#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43524#ackermannFINAL assume true; 43520#ackermannEXIT >#43#return; 43522#L21-1 #res := #t~ret4;havoc #t~ret4; 43615#ackermannFINAL assume true; 43614#ackermannEXIT >#45#return; 43376#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43517#$Ultimate##0 ~m := #in~m;~n := #in~n; 43512#L17 assume !(0 == ~m); 43513#L20 assume !(0 == ~n); 43344#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43465#L17 assume !(0 == ~m); 43462#L20 assume 0 == ~n; 43433#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43419#$Ultimate##0 ~m := #in~m;~n := #in~n; 43478#L17 assume !(0 == ~m); 43443#L20 assume !(0 == ~n); 43431#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43435#$Ultimate##0 ~m := #in~m;~n := #in~n; 43491#L17 assume !(0 == ~m); 43489#L20 assume 0 == ~n; 43434#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43445#$Ultimate##0 ~m := #in~m;~n := #in~n; 43498#L17 assume !(0 == ~m); 43443#L20 assume !(0 == ~n); 43431#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43435#$Ultimate##0 ~m := #in~m;~n := #in~n; 43491#L17 assume !(0 == ~m); 43489#L20 assume 0 == ~n; 43434#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43445#$Ultimate##0 ~m := #in~m;~n := #in~n; 43498#L17 assume !(0 == ~m); 43443#L20 assume !(0 == ~n); 43431#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43435#$Ultimate##0 ~m := #in~m;~n := #in~n; 43491#L17 assume !(0 == ~m); 43489#L20 assume 0 == ~n; 43434#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43445#$Ultimate##0 ~m := #in~m;~n := #in~n; 43498#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43442#L21-1 #res := #t~ret4;havoc #t~ret4; 43436#ackermannFINAL assume true; 43430#ackermannEXIT >#45#return; 43415#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43418#$Ultimate##0 ~m := #in~m;~n := #in~n; 43417#L17 assume !(0 == ~m); 43414#L20 assume !(0 == ~n); 43416#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43538#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43533#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43530#ackermannFINAL assume true; 43527#ackermannEXIT >#47#return; 43525#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43523#ackermannFINAL assume true; 43518#ackermannEXIT >#43#return; 43519#L21-1 #res := #t~ret4;havoc #t~ret4; 43534#ackermannFINAL assume true; 43531#ackermannEXIT >#45#return; 43502#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43509#$Ultimate##0 ~m := #in~m;~n := #in~n; 43508#L17 assume !(0 == ~m); 43501#L20 assume !(0 == ~n); 43424#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43464#L17 assume !(0 == ~m); 43461#L20 assume 0 == ~n; 43441#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43460#$Ultimate##0 ~m := #in~m;~n := #in~n; 43459#L17 assume !(0 == ~m); 43457#L20 assume !(0 == ~n); 43428#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43455#$Ultimate##0 ~m := #in~m;~n := #in~n; 43500#L17 assume !(0 == ~m); 43427#L20 assume 0 == ~n; 43429#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43439#L21-1 #res := #t~ret4;havoc #t~ret4; 43437#ackermannFINAL assume true; 43432#ackermannEXIT >#45#return; 43421#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43426#$Ultimate##0 ~m := #in~m;~n := #in~n; 43547#L17 assume !(0 == ~m); 43546#L20 assume !(0 == ~n); 43420#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43536#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43539#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43603#ackermannFINAL assume true; 43602#ackermannEXIT >#47#return; 43601#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43599#ackermannFINAL assume true; 43600#ackermannEXIT >#45#return; 43366#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43571#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43604#ackermannFINAL assume true; 43598#ackermannEXIT >#45#return; 43367#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43572#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43606#ackermannFINAL assume true; 43605#ackermannEXIT >#45#return; 43368#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43573#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43597#ackermannFINAL assume true; 43584#ackermannEXIT >#45#return; 43364#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43567#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43565#ackermannFINAL assume true; 43528#ackermannEXIT >#47#return; 43526#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43524#ackermannFINAL assume true; 43520#ackermannEXIT >#43#return; 43522#L21-1 #res := #t~ret4;havoc #t~ret4; 43615#ackermannFINAL assume true; 43614#ackermannEXIT >#45#return; 43376#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43517#$Ultimate##0 ~m := #in~m;~n := #in~n; 43512#L17 assume !(0 == ~m); 43513#L20 assume !(0 == ~n); 43344#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43465#L17 assume !(0 == ~m); 43462#L20 assume 0 == ~n; 43433#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43419#$Ultimate##0 ~m := #in~m;~n := #in~n; 43478#L17 assume !(0 == ~m); 43443#L20 assume !(0 == ~n); 43431#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43435#$Ultimate##0 ~m := #in~m;~n := #in~n; 43491#L17 assume !(0 == ~m); 43489#L20 assume 0 == ~n; 43434#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43445#$Ultimate##0 ~m := #in~m;~n := #in~n; 43498#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43439#L21-1 #res := #t~ret4;havoc #t~ret4; 43437#ackermannFINAL assume true; 43432#ackermannEXIT >#45#return; 43421#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43426#$Ultimate##0 ~m := #in~m;~n := #in~n; 43547#L17 assume !(0 == ~m); 43546#L20 assume !(0 == ~n); 43420#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43536#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43539#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43603#ackermannFINAL assume true; 43602#ackermannEXIT >#47#return; 43601#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43599#ackermannFINAL assume true; 43600#ackermannEXIT >#45#return; 43366#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43571#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43604#ackermannFINAL assume true; 43598#ackermannEXIT >#45#return; 43367#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43572#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43606#ackermannFINAL assume true; 43605#ackermannEXIT >#45#return; 43368#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43573#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43597#ackermannFINAL assume true; 43584#ackermannEXIT >#45#return; 43365#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43570#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43589#ackermannFINAL assume true; 43574#ackermannEXIT >#47#return; 43387#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43390#ackermannFINAL assume true; 43623#ackermannEXIT >#45#return; 43474#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43511#$Ultimate##0 ~m := #in~m;~n := #in~n; 43586#L17 assume !(0 == ~m); 43585#L20 assume !(0 == ~n); 43425#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43464#L17 assume !(0 == ~m); 43461#L20 assume 0 == ~n; 43441#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43460#$Ultimate##0 ~m := #in~m;~n := #in~n; 43459#L17 assume !(0 == ~m); 43457#L20 assume !(0 == ~n); 43428#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43455#$Ultimate##0 ~m := #in~m;~n := #in~n; 43500#L17 assume !(0 == ~m); 43427#L20 assume 0 == ~n; 43429#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43439#L21-1 #res := #t~ret4;havoc #t~ret4; 43437#ackermannFINAL assume true; 43432#ackermannEXIT >#45#return; 43421#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43426#$Ultimate##0 ~m := #in~m;~n := #in~n; 43547#L17 assume !(0 == ~m); 43546#L20 assume !(0 == ~n); 43420#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43536#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43539#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43603#ackermannFINAL assume true; 43602#ackermannEXIT >#47#return; 43601#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43599#ackermannFINAL assume true; 43600#ackermannEXIT >#45#return; 43366#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43571#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43604#ackermannFINAL assume true; 43598#ackermannEXIT >#45#return; 43367#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43572#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43606#ackermannFINAL assume true; 43605#ackermannEXIT >#45#return; 43368#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43573#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43597#ackermannFINAL assume true; 43584#ackermannEXIT >#45#return; 43365#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43570#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43589#ackermannFINAL assume true; 43574#ackermannEXIT >#47#return; 43577#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43622#ackermannFINAL assume true; 43621#ackermannEXIT >#45#return; 43475#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43511#$Ultimate##0 ~m := #in~m;~n := #in~n; 43586#L17 assume !(0 == ~m); 43585#L20 assume !(0 == ~n); 43425#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43464#L17 assume !(0 == ~m); 43461#L20 assume 0 == ~n; 43441#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43460#$Ultimate##0 ~m := #in~m;~n := #in~n; 43459#L17 assume !(0 == ~m); 43457#L20 assume !(0 == ~n); 43428#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43455#$Ultimate##0 ~m := #in~m;~n := #in~n; 43500#L17 assume !(0 == ~m); 43427#L20 assume 0 == ~n; 43429#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43439#L21-1 #res := #t~ret4;havoc #t~ret4; 43437#ackermannFINAL assume true; 43432#ackermannEXIT >#45#return; 43421#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43426#$Ultimate##0 ~m := #in~m;~n := #in~n; 43547#L17 assume !(0 == ~m); 43546#L20 assume !(0 == ~n); 43420#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43536#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43539#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43603#ackermannFINAL assume true; 43602#ackermannEXIT >#47#return; 43601#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43599#ackermannFINAL assume true; 43600#ackermannEXIT >#45#return; 43366#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43571#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43604#ackermannFINAL assume true; 43598#ackermannEXIT >#45#return; 43367#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43572#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43606#ackermannFINAL assume true; 43605#ackermannEXIT >#45#return; 43368#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43573#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43597#ackermannFINAL assume true; 43584#ackermannEXIT >#45#return; 43365#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43570#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43589#ackermannFINAL assume true; 43574#ackermannEXIT >#47#return; 43578#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43620#ackermannFINAL assume true; 43619#ackermannEXIT >#45#return; 43471#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43511#$Ultimate##0 ~m := #in~m;~n := #in~n; 43586#L17 assume !(0 == ~m); 43585#L20 assume !(0 == ~n); 43425#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43464#L17 assume !(0 == ~m); 43461#L20 assume 0 == ~n; 43441#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43460#$Ultimate##0 ~m := #in~m;~n := #in~n; 43459#L17 assume !(0 == ~m); 43457#L20 assume !(0 == ~n); 43428#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43455#$Ultimate##0 ~m := #in~m;~n := #in~n; 43500#L17 assume !(0 == ~m); 43427#L20 assume 0 == ~n; 43429#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43439#L21-1 #res := #t~ret4;havoc #t~ret4; 43437#ackermannFINAL assume true; 43432#ackermannEXIT >#45#return; 43421#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43426#$Ultimate##0 ~m := #in~m;~n := #in~n; 43547#L17 assume !(0 == ~m); 43546#L20 assume !(0 == ~n); 43420#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43536#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43539#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43603#ackermannFINAL assume true; 43602#ackermannEXIT >#47#return; 43601#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43599#ackermannFINAL assume true; 43600#ackermannEXIT >#45#return; 43366#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43571#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43604#ackermannFINAL assume true; 43598#ackermannEXIT >#45#return; 43367#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43572#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43606#ackermannFINAL assume true; 43605#ackermannEXIT >#45#return; 43368#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43573#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43597#ackermannFINAL assume true; 43584#ackermannEXIT >#45#return; 43365#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43570#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43589#ackermannFINAL assume true; 43574#ackermannEXIT >#47#return; 43575#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43618#ackermannFINAL assume true; 43587#ackermannEXIT >#45#return; 43472#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43511#$Ultimate##0 ~m := #in~m;~n := #in~n; 43586#L17 assume !(0 == ~m); 43585#L20 assume !(0 == ~n); 43425#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43464#L17 assume !(0 == ~m); 43461#L20 assume 0 == ~n; 43441#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43460#$Ultimate##0 ~m := #in~m;~n := #in~n; 43459#L17 assume !(0 == ~m); 43457#L20 assume !(0 == ~n); 43428#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43455#$Ultimate##0 ~m := #in~m;~n := #in~n; 43500#L17 assume !(0 == ~m); 43427#L20 assume 0 == ~n; 43429#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43439#L21-1 #res := #t~ret4;havoc #t~ret4; 43437#ackermannFINAL assume true; 43432#ackermannEXIT >#45#return; 43421#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43426#$Ultimate##0 ~m := #in~m;~n := #in~n; 43547#L17 assume !(0 == ~m); 43546#L20 assume !(0 == ~n); 43420#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43536#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43539#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43603#ackermannFINAL assume true; 43602#ackermannEXIT >#47#return; 43601#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43599#ackermannFINAL assume true; 43600#ackermannEXIT >#45#return; 43366#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43571#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43604#ackermannFINAL assume true; 43598#ackermannEXIT >#45#return; 43367#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43572#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43606#ackermannFINAL assume true; 43605#ackermannEXIT >#45#return; 43368#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43573#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43597#ackermannFINAL assume true; 43584#ackermannEXIT >#45#return; 43365#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43570#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43589#ackermannFINAL assume true; 43574#ackermannEXIT >#47#return; 43576#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43595#ackermannFINAL assume true; 43579#ackermannEXIT >#47#return; 43581#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43612#ackermannFINAL assume true; 43611#ackermannEXIT >#45#return; 43375#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43517#$Ultimate##0 ~m := #in~m;~n := #in~n; 43512#L17 assume !(0 == ~m); 43513#L20 assume !(0 == ~n); 43344#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43465#L17 assume !(0 == ~m); 43462#L20 assume 0 == ~n; 43433#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43419#$Ultimate##0 ~m := #in~m;~n := #in~n; 43478#L17 assume !(0 == ~m); 43443#L20 assume !(0 == ~n); 43431#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43435#$Ultimate##0 ~m := #in~m;~n := #in~n; 43491#L17 assume !(0 == ~m); 43489#L20 assume 0 == ~n; 43434#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43445#$Ultimate##0 ~m := #in~m;~n := #in~n; 43498#L17 assume !(0 == ~m); 43443#L20 assume !(0 == ~n); 43431#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43435#$Ultimate##0 ~m := #in~m;~n := #in~n; 43491#L17 assume !(0 == ~m); 43489#L20 assume 0 == ~n; 43434#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43445#$Ultimate##0 ~m := #in~m;~n := #in~n; 43498#L17 assume !(0 == ~m); 43443#L20 assume !(0 == ~n); 43431#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43435#$Ultimate##0 ~m := #in~m;~n := #in~n; 43491#L17 assume !(0 == ~m); 43489#L20 assume 0 == ~n; 43434#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43445#$Ultimate##0 ~m := #in~m;~n := #in~n; 43498#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43442#L21-1 #res := #t~ret4;havoc #t~ret4; 43436#ackermannFINAL assume true; 43430#ackermannEXIT >#45#return; 43415#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43418#$Ultimate##0 ~m := #in~m;~n := #in~n; 43417#L17 assume !(0 == ~m); 43414#L20 assume !(0 == ~n); 43416#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43538#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43533#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43530#ackermannFINAL assume true; 43527#ackermannEXIT >#47#return; 43525#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43523#ackermannFINAL assume true; 43518#ackermannEXIT >#43#return; 43519#L21-1 #res := #t~ret4;havoc #t~ret4; 43534#ackermannFINAL assume true; 43531#ackermannEXIT >#45#return; 43502#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43509#$Ultimate##0 ~m := #in~m;~n := #in~n; 43508#L17 assume !(0 == ~m); 43501#L20 assume !(0 == ~n); 43424#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43464#L17 assume !(0 == ~m); 43461#L20 assume 0 == ~n; 43441#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43460#$Ultimate##0 ~m := #in~m;~n := #in~n; 43459#L17 assume !(0 == ~m); 43457#L20 assume !(0 == ~n); 43428#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43455#$Ultimate##0 ~m := #in~m;~n := #in~n; 43500#L17 assume !(0 == ~m); 43427#L20 assume 0 == ~n; 43429#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43439#L21-1 #res := #t~ret4;havoc #t~ret4; 43437#ackermannFINAL assume true; 43432#ackermannEXIT >#45#return; 43421#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43426#$Ultimate##0 ~m := #in~m;~n := #in~n; 43547#L17 assume !(0 == ~m); 43546#L20 assume !(0 == ~n); 43420#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43536#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43539#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43603#ackermannFINAL assume true; 43602#ackermannEXIT >#47#return; 43601#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43599#ackermannFINAL assume true; 43600#ackermannEXIT >#45#return; 43366#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43571#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43604#ackermannFINAL assume true; 43598#ackermannEXIT >#45#return; 43367#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43572#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43606#ackermannFINAL assume true; 43605#ackermannEXIT >#45#return; 43368#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43573#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43597#ackermannFINAL assume true; 43584#ackermannEXIT >#45#return; 43364#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43567#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43565#ackermannFINAL assume true; 43528#ackermannEXIT >#47#return; 43526#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43524#ackermannFINAL assume true; 43520#ackermannEXIT >#43#return; 43522#L21-1 #res := #t~ret4;havoc #t~ret4; 43615#ackermannFINAL assume true; 43614#ackermannEXIT >#45#return; 43376#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43517#$Ultimate##0 ~m := #in~m;~n := #in~n; 43512#L17 assume !(0 == ~m); 43513#L20 assume !(0 == ~n); 43344#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43465#L17 assume !(0 == ~m); 43462#L20 assume 0 == ~n; 43433#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43419#$Ultimate##0 ~m := #in~m;~n := #in~n; 43478#L17 assume !(0 == ~m); 43443#L20 assume !(0 == ~n); 43431#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43435#$Ultimate##0 ~m := #in~m;~n := #in~n; 43491#L17 assume !(0 == ~m); 43489#L20 assume 0 == ~n; 43434#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43445#$Ultimate##0 ~m := #in~m;~n := #in~n; 43498#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43439#L21-1 #res := #t~ret4;havoc #t~ret4; 43437#ackermannFINAL assume true; 43432#ackermannEXIT >#45#return; 43421#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43426#$Ultimate##0 ~m := #in~m;~n := #in~n; 43547#L17 assume !(0 == ~m); 43546#L20 assume !(0 == ~n); 43420#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43536#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43539#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43603#ackermannFINAL assume true; 43602#ackermannEXIT >#47#return; 43601#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43599#ackermannFINAL assume true; 43600#ackermannEXIT >#45#return; 43366#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43571#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43604#ackermannFINAL assume true; 43598#ackermannEXIT >#45#return; 43367#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43572#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43606#ackermannFINAL assume true; 43605#ackermannEXIT >#45#return; 43368#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43573#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43597#ackermannFINAL assume true; 43584#ackermannEXIT >#45#return; 43365#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43570#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43589#ackermannFINAL assume true; 43574#ackermannEXIT >#47#return; 43387#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43390#ackermannFINAL assume true; 43623#ackermannEXIT >#45#return; 43474#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43511#$Ultimate##0 ~m := #in~m;~n := #in~n; 43586#L17 assume !(0 == ~m); 43585#L20 assume !(0 == ~n); 43425#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43464#L17 assume !(0 == ~m); 43461#L20 assume 0 == ~n; 43441#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43460#$Ultimate##0 ~m := #in~m;~n := #in~n; 43459#L17 assume !(0 == ~m); 43457#L20 assume !(0 == ~n); 43428#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43455#$Ultimate##0 ~m := #in~m;~n := #in~n; 43500#L17 assume !(0 == ~m); 43427#L20 assume 0 == ~n; 43429#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43439#L21-1 #res := #t~ret4;havoc #t~ret4; 43437#ackermannFINAL assume true; 43432#ackermannEXIT >#45#return; 43421#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43426#$Ultimate##0 ~m := #in~m;~n := #in~n; 43547#L17 assume !(0 == ~m); 43546#L20 assume !(0 == ~n); 43420#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43536#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43539#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43603#ackermannFINAL assume true; 43602#ackermannEXIT >#47#return; 43601#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43599#ackermannFINAL assume true; 43600#ackermannEXIT >#45#return; 43366#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43571#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43604#ackermannFINAL assume true; 43598#ackermannEXIT >#45#return; 43367#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43572#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43606#ackermannFINAL assume true; 43605#ackermannEXIT >#45#return; 43368#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43573#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43597#ackermannFINAL assume true; 43584#ackermannEXIT >#45#return; 43365#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43570#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43589#ackermannFINAL assume true; 43574#ackermannEXIT >#47#return; 43577#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43622#ackermannFINAL assume true; 43621#ackermannEXIT >#45#return; 43475#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43511#$Ultimate##0 ~m := #in~m;~n := #in~n; 43586#L17 assume !(0 == ~m); 43585#L20 assume !(0 == ~n); 43425#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43464#L17 assume !(0 == ~m); 43461#L20 assume 0 == ~n; 43441#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43460#$Ultimate##0 ~m := #in~m;~n := #in~n; 43459#L17 assume !(0 == ~m); 43457#L20 assume !(0 == ~n); 43428#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43455#$Ultimate##0 ~m := #in~m;~n := #in~n; 43500#L17 assume !(0 == ~m); 43427#L20 assume 0 == ~n; 43429#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43439#L21-1 #res := #t~ret4;havoc #t~ret4; 43437#ackermannFINAL assume true; 43432#ackermannEXIT >#45#return; 43421#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43426#$Ultimate##0 ~m := #in~m;~n := #in~n; 43547#L17 assume !(0 == ~m); 43546#L20 assume !(0 == ~n); 43420#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43536#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43539#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43603#ackermannFINAL assume true; 43602#ackermannEXIT >#47#return; 43601#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43599#ackermannFINAL assume true; 43600#ackermannEXIT >#45#return; 43366#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43571#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43604#ackermannFINAL assume true; 43598#ackermannEXIT >#45#return; 43367#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43572#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43606#ackermannFINAL assume true; 43605#ackermannEXIT >#45#return; 43368#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43573#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43597#ackermannFINAL assume true; 43584#ackermannEXIT >#45#return; 43365#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43570#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43589#ackermannFINAL assume true; 43574#ackermannEXIT >#47#return; 43578#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43620#ackermannFINAL assume true; 43619#ackermannEXIT >#45#return; 43471#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43511#$Ultimate##0 ~m := #in~m;~n := #in~n; 43586#L17 assume !(0 == ~m); 43585#L20 assume !(0 == ~n); 43425#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43464#L17 assume !(0 == ~m); 43461#L20 assume 0 == ~n; 43441#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43460#$Ultimate##0 ~m := #in~m;~n := #in~n; 43459#L17 assume !(0 == ~m); 43457#L20 assume !(0 == ~n); 43428#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43455#$Ultimate##0 ~m := #in~m;~n := #in~n; 43500#L17 assume !(0 == ~m); 43427#L20 assume 0 == ~n; 43429#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43439#L21-1 #res := #t~ret4;havoc #t~ret4; 43437#ackermannFINAL assume true; 43432#ackermannEXIT >#45#return; 43421#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43426#$Ultimate##0 ~m := #in~m;~n := #in~n; 43547#L17 assume !(0 == ~m); 43546#L20 assume !(0 == ~n); 43420#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43536#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43539#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43603#ackermannFINAL assume true; 43602#ackermannEXIT >#47#return; 43601#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43599#ackermannFINAL assume true; 43600#ackermannEXIT >#45#return; 43366#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43571#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43604#ackermannFINAL assume true; 43598#ackermannEXIT >#45#return; 43367#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43572#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43606#ackermannFINAL assume true; 43605#ackermannEXIT >#45#return; 43368#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43573#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43597#ackermannFINAL assume true; 43584#ackermannEXIT >#45#return; 43365#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43570#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43589#ackermannFINAL assume true; 43574#ackermannEXIT >#47#return; 43575#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43618#ackermannFINAL assume true; 43587#ackermannEXIT >#45#return; 43472#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43511#$Ultimate##0 ~m := #in~m;~n := #in~n; 43586#L17 assume !(0 == ~m); 43585#L20 assume !(0 == ~n); 43425#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43464#L17 assume !(0 == ~m); 43461#L20 assume 0 == ~n; 43441#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43460#$Ultimate##0 ~m := #in~m;~n := #in~n; 43459#L17 assume !(0 == ~m); 43457#L20 assume !(0 == ~n); 43428#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43455#$Ultimate##0 ~m := #in~m;~n := #in~n; 43500#L17 assume !(0 == ~m); 43427#L20 assume 0 == ~n; 43429#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43439#L21-1 #res := #t~ret4;havoc #t~ret4; 43437#ackermannFINAL assume true; 43432#ackermannEXIT >#45#return; 43421#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43426#$Ultimate##0 ~m := #in~m;~n := #in~n; 43547#L17 assume !(0 == ~m); 43546#L20 assume !(0 == ~n); 43420#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43536#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43539#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43603#ackermannFINAL assume true; 43602#ackermannEXIT >#47#return; 43601#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43599#ackermannFINAL assume true; 43600#ackermannEXIT >#45#return; 43366#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43571#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43604#ackermannFINAL assume true; 43598#ackermannEXIT >#45#return; 43367#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43572#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43606#ackermannFINAL assume true; 43605#ackermannEXIT >#45#return; 43368#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43573#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43597#ackermannFINAL assume true; 43584#ackermannEXIT >#45#return; 43365#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43570#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43589#ackermannFINAL assume true; 43574#ackermannEXIT >#47#return; 43576#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43595#ackermannFINAL assume true; 43579#ackermannEXIT >#47#return; 43583#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43610#ackermannFINAL assume true; 43609#ackermannEXIT >#45#return; 43378#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43517#$Ultimate##0 ~m := #in~m;~n := #in~n; 43512#L17 assume !(0 == ~m); 43513#L20 assume !(0 == ~n); 43344#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43465#L17 assume !(0 == ~m); 43462#L20 assume 0 == ~n; 43433#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43419#$Ultimate##0 ~m := #in~m;~n := #in~n; 43478#L17 assume !(0 == ~m); 43443#L20 assume !(0 == ~n); 43431#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43435#$Ultimate##0 ~m := #in~m;~n := #in~n; 43491#L17 assume !(0 == ~m); 43489#L20 assume 0 == ~n; 43434#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43445#$Ultimate##0 ~m := #in~m;~n := #in~n; 43498#L17 assume !(0 == ~m); 43443#L20 assume !(0 == ~n); 43431#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43435#$Ultimate##0 ~m := #in~m;~n := #in~n; 43491#L17 assume !(0 == ~m); 43489#L20 assume 0 == ~n; 43434#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43445#$Ultimate##0 ~m := #in~m;~n := #in~n; 43498#L17 assume !(0 == ~m); 43443#L20 assume !(0 == ~n); 43431#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43435#$Ultimate##0 ~m := #in~m;~n := #in~n; 43491#L17 assume !(0 == ~m); 43489#L20 assume 0 == ~n; 43434#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43445#$Ultimate##0 ~m := #in~m;~n := #in~n; 43498#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43442#L21-1 #res := #t~ret4;havoc #t~ret4; 43436#ackermannFINAL assume true; 43430#ackermannEXIT >#45#return; 43415#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43418#$Ultimate##0 ~m := #in~m;~n := #in~n; 43417#L17 assume !(0 == ~m); 43414#L20 assume !(0 == ~n); 43416#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43538#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43533#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43530#ackermannFINAL assume true; 43527#ackermannEXIT >#47#return; 43525#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43523#ackermannFINAL assume true; 43518#ackermannEXIT >#43#return; 43519#L21-1 #res := #t~ret4;havoc #t~ret4; 43534#ackermannFINAL assume true; 43531#ackermannEXIT >#45#return; 43502#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43509#$Ultimate##0 ~m := #in~m;~n := #in~n; 43508#L17 assume !(0 == ~m); 43501#L20 assume !(0 == ~n); 43424#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43464#L17 assume !(0 == ~m); 43461#L20 assume 0 == ~n; 43441#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43460#$Ultimate##0 ~m := #in~m;~n := #in~n; 43459#L17 assume !(0 == ~m); 43457#L20 assume !(0 == ~n); 43428#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43455#$Ultimate##0 ~m := #in~m;~n := #in~n; 43500#L17 assume !(0 == ~m); 43427#L20 assume 0 == ~n; 43429#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43439#L21-1 #res := #t~ret4;havoc #t~ret4; 43437#ackermannFINAL assume true; 43432#ackermannEXIT >#45#return; 43421#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43426#$Ultimate##0 ~m := #in~m;~n := #in~n; 43547#L17 assume !(0 == ~m); 43546#L20 assume !(0 == ~n); 43420#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43536#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43539#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43603#ackermannFINAL assume true; 43602#ackermannEXIT >#47#return; 43601#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43599#ackermannFINAL assume true; 43600#ackermannEXIT >#45#return; 43366#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43571#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43604#ackermannFINAL assume true; 43598#ackermannEXIT >#45#return; 43367#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43572#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43606#ackermannFINAL assume true; 43605#ackermannEXIT >#45#return; 43368#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43573#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43597#ackermannFINAL assume true; 43584#ackermannEXIT >#45#return; 43364#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43567#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43565#ackermannFINAL assume true; 43528#ackermannEXIT >#47#return; 43526#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43524#ackermannFINAL assume true; 43520#ackermannEXIT >#43#return; 43522#L21-1 #res := #t~ret4;havoc #t~ret4; 43615#ackermannFINAL assume true; 43614#ackermannEXIT >#45#return; 43376#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43517#$Ultimate##0 ~m := #in~m;~n := #in~n; 43512#L17 assume !(0 == ~m); 43513#L20 assume !(0 == ~n); 43344#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43469#L17 assume !(0 == ~m); 43505#L20 assume !(0 == ~n); 43343#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43393#$Ultimate##0 ~m := #in~m;~n := #in~n; 43465#L17 assume !(0 == ~m); 43462#L20 assume 0 == ~n; 43433#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43419#$Ultimate##0 ~m := #in~m;~n := #in~n; 43478#L17 assume !(0 == ~m); 43443#L20 assume !(0 == ~n); 43431#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43435#$Ultimate##0 ~m := #in~m;~n := #in~n; 43491#L17 assume !(0 == ~m); 43489#L20 assume 0 == ~n; 43434#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43445#$Ultimate##0 ~m := #in~m;~n := #in~n; 43498#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43439#L21-1 #res := #t~ret4;havoc #t~ret4; 43437#ackermannFINAL assume true; 43432#ackermannEXIT >#45#return; 43421#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43426#$Ultimate##0 ~m := #in~m;~n := #in~n; 43547#L17 assume !(0 == ~m); 43546#L20 assume !(0 == ~n); 43420#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43536#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43539#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43603#ackermannFINAL assume true; 43602#ackermannEXIT >#47#return; 43601#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43599#ackermannFINAL assume true; 43600#ackermannEXIT >#45#return; 43366#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43571#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43604#ackermannFINAL assume true; 43598#ackermannEXIT >#45#return; 43367#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43572#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43606#ackermannFINAL assume true; 43605#ackermannEXIT >#45#return; 43368#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43573#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43597#ackermannFINAL assume true; 43584#ackermannEXIT >#45#return; 43365#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43570#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43589#ackermannFINAL assume true; 43574#ackermannEXIT >#47#return; 43387#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43390#ackermannFINAL assume true; 43623#ackermannEXIT >#45#return; 43474#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43511#$Ultimate##0 ~m := #in~m;~n := #in~n; 43586#L17 assume !(0 == ~m); 43585#L20 assume !(0 == ~n); 43425#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43464#L17 assume !(0 == ~m); 43461#L20 assume 0 == ~n; 43441#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43460#$Ultimate##0 ~m := #in~m;~n := #in~n; 43459#L17 assume !(0 == ~m); 43457#L20 assume !(0 == ~n); 43428#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43455#$Ultimate##0 ~m := #in~m;~n := #in~n; 43500#L17 assume !(0 == ~m); 43427#L20 assume 0 == ~n; 43429#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43439#L21-1 #res := #t~ret4;havoc #t~ret4; 43437#ackermannFINAL assume true; 43432#ackermannEXIT >#45#return; 43421#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43426#$Ultimate##0 ~m := #in~m;~n := #in~n; 43547#L17 assume !(0 == ~m); 43546#L20 assume !(0 == ~n); 43420#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43536#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43539#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43603#ackermannFINAL assume true; 43602#ackermannEXIT >#47#return; 43601#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43599#ackermannFINAL assume true; 43600#ackermannEXIT >#45#return; 43366#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43571#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43604#ackermannFINAL assume true; 43598#ackermannEXIT >#45#return; 43367#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43572#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43606#ackermannFINAL assume true; 43605#ackermannEXIT >#45#return; 43368#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43573#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43597#ackermannFINAL assume true; 43584#ackermannEXIT >#45#return; 43365#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43570#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43589#ackermannFINAL assume true; 43574#ackermannEXIT >#47#return; 43577#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43622#ackermannFINAL assume true; 43621#ackermannEXIT >#45#return; 43475#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43511#$Ultimate##0 ~m := #in~m;~n := #in~n; 43586#L17 assume !(0 == ~m); 43585#L20 assume !(0 == ~n); 43425#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43464#L17 assume !(0 == ~m); 43461#L20 assume 0 == ~n; 43441#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43460#$Ultimate##0 ~m := #in~m;~n := #in~n; 43459#L17 assume !(0 == ~m); 43457#L20 assume !(0 == ~n); 43428#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43455#$Ultimate##0 ~m := #in~m;~n := #in~n; 43500#L17 assume !(0 == ~m); 43427#L20 assume 0 == ~n; 43429#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43439#L21-1 #res := #t~ret4;havoc #t~ret4; 43437#ackermannFINAL assume true; 43432#ackermannEXIT >#45#return; 43421#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43426#$Ultimate##0 ~m := #in~m;~n := #in~n; 43547#L17 assume !(0 == ~m); 43546#L20 assume !(0 == ~n); 43420#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43536#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43539#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43603#ackermannFINAL assume true; 43602#ackermannEXIT >#47#return; 43601#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43599#ackermannFINAL assume true; 43600#ackermannEXIT >#45#return; 43366#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43571#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43604#ackermannFINAL assume true; 43598#ackermannEXIT >#45#return; 43367#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43572#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43606#ackermannFINAL assume true; 43605#ackermannEXIT >#45#return; 43368#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43573#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43597#ackermannFINAL assume true; 43584#ackermannEXIT >#45#return; 43365#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43570#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43589#ackermannFINAL assume true; 43574#ackermannEXIT >#47#return; 43578#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43620#ackermannFINAL assume true; 43619#ackermannEXIT >#45#return; 43471#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43511#$Ultimate##0 ~m := #in~m;~n := #in~n; 43586#L17 assume !(0 == ~m); 43585#L20 assume !(0 == ~n); 43425#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43464#L17 assume !(0 == ~m); 43461#L20 assume 0 == ~n; 43441#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43460#$Ultimate##0 ~m := #in~m;~n := #in~n; 43459#L17 assume !(0 == ~m); 43457#L20 assume !(0 == ~n); 43428#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43455#$Ultimate##0 ~m := #in~m;~n := #in~n; 43500#L17 assume !(0 == ~m); 43427#L20 assume 0 == ~n; 43429#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43439#L21-1 #res := #t~ret4;havoc #t~ret4; 43437#ackermannFINAL assume true; 43432#ackermannEXIT >#45#return; 43421#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43426#$Ultimate##0 ~m := #in~m;~n := #in~n; 43547#L17 assume !(0 == ~m); 43546#L20 assume !(0 == ~n); 43420#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43536#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43539#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43603#ackermannFINAL assume true; 43602#ackermannEXIT >#47#return; 43601#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43599#ackermannFINAL assume true; 43600#ackermannEXIT >#45#return; 43366#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43571#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43604#ackermannFINAL assume true; 43598#ackermannEXIT >#45#return; 43367#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43572#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43606#ackermannFINAL assume true; 43605#ackermannEXIT >#45#return; 43368#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43573#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43597#ackermannFINAL assume true; 43584#ackermannEXIT >#45#return; 43365#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43570#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43589#ackermannFINAL assume true; 43574#ackermannEXIT >#47#return; 43575#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43618#ackermannFINAL assume true; 43587#ackermannEXIT >#45#return; 43472#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43511#$Ultimate##0 ~m := #in~m;~n := #in~n; 43586#L17 assume !(0 == ~m); 43585#L20 assume !(0 == ~n); 43425#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43468#L17 assume !(0 == ~m); 43504#L20 assume !(0 == ~n); 43423#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43467#$Ultimate##0 ~m := #in~m;~n := #in~n; 43464#L17 assume !(0 == ~m); 43461#L20 assume 0 == ~n; 43441#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43460#$Ultimate##0 ~m := #in~m;~n := #in~n; 43459#L17 assume !(0 == ~m); 43457#L20 assume !(0 == ~n); 43428#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43455#$Ultimate##0 ~m := #in~m;~n := #in~n; 43500#L17 assume !(0 == ~m); 43427#L20 assume 0 == ~n; 43429#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43493#L21-1 #res := #t~ret4;havoc #t~ret4; 43492#ackermannFINAL assume true; 43454#ackermannEXIT >#45#return; 43452#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43453#$Ultimate##0 ~m := #in~m;~n := #in~n; 43458#L17 assume 0 == ~m;#res := 1 + ~n; 43456#ackermannFINAL assume true; 43451#ackermannEXIT >#47#return; 43450#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43448#ackermannFINAL assume true; 43440#ackermannEXIT >#43#return; 43439#L21-1 #res := #t~ret4;havoc #t~ret4; 43437#ackermannFINAL assume true; 43432#ackermannEXIT >#45#return; 43421#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43426#$Ultimate##0 ~m := #in~m;~n := #in~n; 43547#L17 assume !(0 == ~m); 43546#L20 assume !(0 == ~n); 43420#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43422#$Ultimate##0 ~m := #in~m;~n := #in~n; 43507#L17 assume !(0 == ~m); 43506#L20 assume !(0 == ~n); 43391#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43470#$Ultimate##0 ~m := #in~m;~n := #in~n; 43466#L17 assume !(0 == ~m); 43463#L20 assume !(0 == ~n); 43382#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43392#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43536#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43539#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43603#ackermannFINAL assume true; 43602#ackermannEXIT >#47#return; 43601#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43599#ackermannFINAL assume true; 43600#ackermannEXIT >#45#return; 43366#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43571#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43604#ackermannFINAL assume true; 43598#ackermannEXIT >#45#return; 43367#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43572#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43606#ackermannFINAL assume true; 43605#ackermannEXIT >#45#return; 43368#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43573#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43597#ackermannFINAL assume true; 43584#ackermannEXIT >#45#return; 43365#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43516#$Ultimate##0 ~m := #in~m;~n := #in~n; 43363#L17 assume !(0 == ~m); 43369#L20 assume !(0 == ~n); 43357#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43360#L17 assume !(0 == ~m); 43510#L20 assume !(0 == ~n); 43358#L23 call #t~ret5 := ackermann(~m, ~n - 1);< 43356#$Ultimate##0 ~m := #in~m;~n := #in~n; 43359#L17 assume !(0 == ~m); 43497#L20 assume 0 == ~n; 43381#L21 call #t~ret4 := ackermann(~m - 1, 1);< 43383#$Ultimate##0 ~m := #in~m;~n := #in~n; 43499#L17 assume 0 == ~m;#res := 1 + ~n; 43496#ackermannFINAL assume true; 43494#ackermannEXIT >#43#return; 43495#L21-1 #res := #t~ret4;havoc #t~ret4; 43564#ackermannFINAL assume true; 43562#ackermannEXIT >#45#return; 43559#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43560#$Ultimate##0 ~m := #in~m;~n := #in~n; 43563#L17 assume 0 == ~m;#res := 1 + ~n; 43561#ackermannFINAL assume true; 43558#ackermannEXIT >#47#return; 43557#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43556#ackermannFINAL assume true; 43554#ackermannEXIT >#45#return; 43551#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43552#$Ultimate##0 ~m := #in~m;~n := #in~n; 43555#L17 assume 0 == ~m;#res := 1 + ~n; 43553#ackermannFINAL assume true; 43550#ackermannEXIT >#47#return; 43549#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43548#ackermannFINAL assume true; 43545#ackermannEXIT >#45#return; 43537#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43541#$Ultimate##0 ~m := #in~m;~n := #in~n; 43544#L17 assume 0 == ~m;#res := 1 + ~n; 43543#ackermannFINAL assume true; 43535#ackermannEXIT >#47#return; 43540#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43617#ackermannFINAL assume true; 43616#ackermannEXIT >#45#return; 43354#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43592#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43613#ackermannFINAL assume true; 43593#ackermannEXIT >#45#return; 43353#L23-1 call #t~ret6 := ackermann(~m - 1, #t~ret5);< 43352#$Ultimate##0 ~m := #in~m;~n := #in~n; 43355#L17 assume 0 == ~m;#res := 1 + ~n; 43362#ackermannFINAL assume true; 43591#ackermannEXIT >#47#return; 43590#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43588#ackermannFINAL assume true; 43569#ackermannEXIT >#47#return; 43570#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43589#ackermannFINAL assume true; 43574#ackermannEXIT >#47#return; 43576#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43595#ackermannFINAL assume true; 43579#ackermannEXIT >#47#return; 43582#L23-2 #res := #t~ret6;havoc #t~ret5;havoc #t~ret6; 43608#ackermannFINAL assume true; 43607#ackermannEXIT >#45#return; 43372#L23-1 [2023-02-18 08:56:42,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:56:42,883 INFO L85 PathProgramCache]: Analyzing trace with hash -630874818, now seen corresponding path program 10 times [2023-02-18 08:56:42,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:56:42,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725097693] [2023-02-18 08:56:42,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:56:42,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:56:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:43,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-02-18 08:56:43,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:43,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:43,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:44,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:44,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:44,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:44,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-18 08:56:44,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:44,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:44,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:44,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:56:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:56:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-02-18 08:56:44,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:44,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:44,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:44,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-18 08:56:44,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:44,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:44,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:44,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:56:44,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:56:44,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-18 08:56:44,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:44,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:44,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:44,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:44,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:44,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:56:44,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:56:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:56:44,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:56:44,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-18 08:56:44,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:44,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:44,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:44,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:44,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:44,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:44,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:56:44,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:56:44,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:56:44,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:56:44,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-18 08:56:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:44,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:44,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:44,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:44,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:44,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:44,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:44,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:56:44,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:56:44,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:56:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:56:44,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-18 08:56:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:44,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:44,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:44,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:56:44,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:56:44,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:56:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:56:44,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:56:44,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:56:44,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:56:44,584 INFO L134 CoverageAnalysis]: Checked inductivity of 16858 backedges. 435 proven. 2307 refuted. 0 times theorem prover too weak. 14116 trivial. 0 not checked. [2023-02-18 08:56:44,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:56:44,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725097693] [2023-02-18 08:56:44,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725097693] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 08:56:44,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282691076] [2023-02-18 08:56:44,585 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-18 08:56:44,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 08:56:44,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:56:44,593 INFO L229 MonitoredProcess]: Starting monitored process 165 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 08:56:44,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (165)] Waiting until timeout for monitored process [2023-02-18 08:56:45,391 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-18 08:56:45,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 08:56:45,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 1442 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-18 08:56:45,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:56:45,489 INFO L134 CoverageAnalysis]: Checked inductivity of 16858 backedges. 449 proven. 2293 refuted. 0 times theorem prover too weak. 14116 trivial. 0 not checked. [2023-02-18 08:56:45,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 08:56:45,763 INFO L134 CoverageAnalysis]: Checked inductivity of 16858 backedges. 449 proven. 2345 refuted. 0 times theorem prover too weak. 14064 trivial. 0 not checked. [2023-02-18 08:56:45,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282691076] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 08:56:45,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 08:56:45,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 14] total 20 [2023-02-18 08:56:45,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043701240] [2023-02-18 08:56:45,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 08:56:45,765 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-18 08:56:45,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:56:45,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1588779923, now seen corresponding path program 8 times [2023-02-18 08:56:45,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:56:45,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622434113] [2023-02-18 08:56:45,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:56:45,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:56:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:57:45,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-18 08:57:55,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:58:31,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:58:37,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:58:52,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:58:54,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:01,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:01,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:02,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:02,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:02,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-18 08:59:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:02,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:02,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:02,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:02,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:02,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:02,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:02,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-02-18 08:59:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:02,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:02,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:02,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:02,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:02,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:02,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-18 08:59:02,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:02,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:02,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:02,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:02,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:02,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-18 08:59:02,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:02,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:02,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:02,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:02,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:02,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:02,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:02,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:02,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:02,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:02,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:02,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-18 08:59:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:02,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:02,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:02,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:02,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:02,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:02,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:02,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:02,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:02,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-18 08:59:02,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:02,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:02,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:02,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:02,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:02,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:02,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:02,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:02,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:02,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:02,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-18 08:59:02,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:02,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:02,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:02,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:02,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:02,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:02,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:02,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:02,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:02,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:02,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:02,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 512 [2023-02-18 08:59:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:09,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:14,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:14,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:17,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:19,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:19,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:20,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:20,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:20,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:20,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:21,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:21,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:21,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:21,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:21,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-18 08:59:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:21,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:21,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:21,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-02-18 08:59:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:21,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:21,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:21,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:21,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:21,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:21,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:21,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-18 08:59:21,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:21,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-18 08:59:21,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:21,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:21,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:21,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:21,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:21,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-18 08:59:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:21,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:21,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:21,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:21,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:21,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:21,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-18 08:59:21,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:21,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:21,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:21,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:21,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:21,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-18 08:59:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:21,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:21,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:21,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:21,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 512 [2023-02-18 08:59:21,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:21,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:21,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-18 08:59:22,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:22,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:22,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-18 08:59:22,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:22,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:22,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:22,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:22,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-18 08:59:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:22,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:22,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:22,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-18 08:59:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:22,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:22,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:22,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-18 08:59:22,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:22,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:22,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:22,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:22,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 921 [2023-02-18 08:59:22,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:22,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-18 08:59:22,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:22,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:22,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-18 08:59:22,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:22,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:22,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:22,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-18 08:59:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:22,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:22,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:22,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:22,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:22,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-18 08:59:22,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:23,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:23,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:23,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-18 08:59:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:23,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:23,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:23,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1330 [2023-02-18 08:59:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:23,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-18 08:59:23,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:23,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:23,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-18 08:59:23,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:23,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:23,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:23,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:23,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-18 08:59:23,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:23,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:23,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:23,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:23,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:23,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-18 08:59:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:23,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:23,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:23,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:23,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:23,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-18 08:59:23,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:23,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:23,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1739 [2023-02-18 08:59:23,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-18 08:59:23,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:23,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:23,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-18 08:59:23,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:23,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:23,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:23,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:23,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:23,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-18 08:59:23,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:23,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:23,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:23,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-18 08:59:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:23,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:23,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-18 08:59:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:23,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:23,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:23,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:23,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:23,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2148 [2023-02-18 08:59:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:23,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:24,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:24,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:24,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:24,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:24,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:24,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:24,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-18 08:59:24,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:24,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:24,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:24,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:24,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:24,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:24,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-18 08:59:24,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:24,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:24,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:24,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:24,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:24,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:24,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:24,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:24,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:24,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-18 08:59:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:24,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:24,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:24,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:24,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:24,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:24,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:24,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:24,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:24,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:24,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-18 08:59:24,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:24,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:24,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:24,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:24,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:24,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:24,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-18 08:59:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:24,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:24,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:24,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:24,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:24,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:24,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:24,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3073 [2023-02-18 08:59:24,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:26,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:26,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:27,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:27,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:28,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:28,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:28,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:28,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:28,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:28,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:28,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:29,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-18 08:59:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:29,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:29,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-02-18 08:59:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:29,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-18 08:59:29,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:29,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:29,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:29,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-18 08:59:29,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:29,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:29,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:29,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:29,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:29,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-18 08:59:29,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:29,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:29,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:29,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:29,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-18 08:59:29,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:29,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:29,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:29,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:29,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:29,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-18 08:59:29,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:29,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:29,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:29,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:29,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 512 [2023-02-18 08:59:29,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:29,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-18 08:59:29,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:29,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:29,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-18 08:59:29,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:29,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:29,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-18 08:59:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:29,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:29,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:29,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:29,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:29,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-18 08:59:29,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:29,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:29,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:29,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-18 08:59:29,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:29,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:29,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 921 [2023-02-18 08:59:29,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:29,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-18 08:59:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:29,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:29,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:29,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-18 08:59:29,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:29,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:29,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:30,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:30,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:30,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:30,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-18 08:59:30,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:30,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:30,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:30,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-18 08:59:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:30,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:30,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:30,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:30,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-18 08:59:30,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:30,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:30,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:30,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:30,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1330 [2023-02-18 08:59:30,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:30,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-18 08:59:30,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:30,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:30,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:30,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-18 08:59:30,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:30,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:30,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-18 08:59:30,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:30,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:30,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:30,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:30,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:30,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-18 08:59:30,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:30,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:30,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-18 08:59:30,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:30,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:30,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1739 [2023-02-18 08:59:30,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:30,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-18 08:59:30,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:30,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:30,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:30,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-18 08:59:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:30,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:30,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:30,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:30,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-18 08:59:30,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:30,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:30,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:30,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-18 08:59:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:30,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:30,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:30,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-18 08:59:30,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:30,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:30,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:31,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:31,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:31,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:31,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:31,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:31,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:31,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:31,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2148 [2023-02-18 08:59:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:31,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:31,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:31,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:31,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-18 08:59:31,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:31,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:31,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:31,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:31,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:31,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-18 08:59:31,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:31,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:31,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:31,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:31,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:31,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:31,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-18 08:59:31,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:31,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:31,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:31,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:31,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:31,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:31,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-18 08:59:31,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:31,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:31,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:31,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:31,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:31,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:31,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:31,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:31,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:31,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:31,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-18 08:59:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:31,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:31,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:31,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:31,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:31,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:31,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:31,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:31,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:31,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:31,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5634 [2023-02-18 08:59:31,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:33,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:33,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:34,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:34,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:35,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:35,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:35,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:35,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:36,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-18 08:59:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:36,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-02-18 08:59:36,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-18 08:59:36,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:36,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:36,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:36,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-18 08:59:36,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:36,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:36,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:36,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:36,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:36,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-18 08:59:36,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:36,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:36,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:36,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:36,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:36,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-18 08:59:36,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:36,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:36,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:36,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-18 08:59:36,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:36,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:36,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:36,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:36,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 512 [2023-02-18 08:59:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:36,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-18 08:59:36,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:36,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:36,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-18 08:59:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:36,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:36,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:36,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-18 08:59:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:36,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:36,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:36,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:36,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-18 08:59:36,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:36,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:36,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:36,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:36,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:36,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-18 08:59:36,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:36,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:36,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:36,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:36,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 921 [2023-02-18 08:59:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:36,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:37,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-18 08:59:37,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:37,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:37,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:37,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-18 08:59:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:37,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:37,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-18 08:59:37,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:37,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:37,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-18 08:59:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:37,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:37,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:37,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:37,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-18 08:59:37,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:37,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:37,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:37,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:37,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1330 [2023-02-18 08:59:37,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:37,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-18 08:59:37,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:37,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:37,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:37,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-18 08:59:37,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:37,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:37,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:37,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:37,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:37,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-18 08:59:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:37,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-18 08:59:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:37,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:37,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:37,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:37,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-18 08:59:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:37,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:37,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:37,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:37,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:37,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1739 [2023-02-18 08:59:37,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:37,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:37,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:38,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-18 08:59:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:38,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:38,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:38,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-18 08:59:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:38,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:38,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:38,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:38,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:38,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-18 08:59:38,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:38,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:38,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:38,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-18 08:59:38,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:38,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:38,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:38,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:38,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-18 08:59:38,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:38,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:38,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:38,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:38,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:38,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2148 [2023-02-18 08:59:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-18 08:59:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:38,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:38,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-18 08:59:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:38,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:38,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:38,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:38,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-02-18 08:59:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:38,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:38,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-02-18 08:59:38,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:38,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:38,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:38,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:38,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:38,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-02-18 08:59:38,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:38,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:38,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:39,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:39,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:39,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-18 08:59:39,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:39,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-18 08:59:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:39,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-18 08:59:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:39,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 08:59:39,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:39,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-02-18 08:59:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:39,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-18 08:59:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:59:39,097 INFO L134 CoverageAnalysis]: Checked inductivity of 4420857 backedges. 22094 proven. 137296 refuted. 0 times theorem prover too weak. 4261467 trivial. 0 not checked. [2023-02-18 08:59:39,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:59:39,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622434113] [2023-02-18 08:59:39,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622434113] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 08:59:39,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924984299] [2023-02-18 08:59:39,098 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 08:59:39,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 08:59:39,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:59:39,099 INFO L229 MonitoredProcess]: Starting monitored process 166 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 08:59:39,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (166)] Waiting until timeout for monitored process [2023-02-18 08:59:42,941 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 08:59:42,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 08:59:43,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 22947 conjuncts, 51 conjunts are in the unsatisfiable core [2023-02-18 08:59:43,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:59:43,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4420857 backedges. 374678 proven. 609 refuted. 0 times theorem prover too weak. 4045570 trivial. 0 not checked. [2023-02-18 08:59:43,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 08:59:48,482 INFO L134 CoverageAnalysis]: Checked inductivity of 4420857 backedges. 10662 proven. 104753 refuted. 0 times theorem prover too weak. 4305442 trivial. 0 not checked. [2023-02-18 08:59:48,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924984299] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 08:59:48,482 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 08:59:48,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 28, 39] total 62 [2023-02-18 08:59:48,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803874761] [2023-02-18 08:59:48,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 08:59:48,493 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-18 08:59:48,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 08:59:48,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-18 08:59:48,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2023-02-18 08:59:48,494 INFO L87 Difference]: Start difference. First operand 282 states and 366 transitions. cyclomatic complexity: 89 Second operand has 21 states, 17 states have (on average 3.235294117647059) internal successors, (55), 16 states have internal predecessors, (55), 15 states have call successors, (22), 2 states have call predecessors, (22), 7 states have return successors, (31), 9 states have call predecessors, (31), 14 states have call successors, (31) [2023-02-18 08:59:48,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 08:59:48,698 INFO L93 Difference]: Finished difference Result 193 states and 211 transitions. [2023-02-18 08:59:48,698 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 193 states and 211 transitions. [2023-02-18 08:59:48,700 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-02-18 08:59:48,701 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 193 states to 0 states and 0 transitions. [2023-02-18 08:59:48,701 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-02-18 08:59:48,701 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-02-18 08:59:48,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-02-18 08:59:48,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-18 08:59:48,701 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-18 08:59:48,701 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-18 08:59:48,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 08:59:48,703 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-18 08:59:48,703 INFO L335 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2023-02-18 08:59:48,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-02-18 08:59:48,703 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-02-18 08:59:48,703 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-02-18 08:59:48,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.02 08:59:48 BoogieIcfgContainer [2023-02-18 08:59:48,710 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-02-18 08:59:48,711 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 08:59:48,711 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 08:59:48,711 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 08:59:48,711 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 08:55:45" (3/4) ... [2023-02-18 08:59:48,717 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-18 08:59:48,717 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 08:59:48,717 INFO L158 Benchmark]: Toolchain (without parser) took 244199.18ms. Allocated memory was 123.7MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 78.7MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 941.2MB. Max. memory is 16.1GB. [2023-02-18 08:59:48,717 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 123.7MB. Free memory is still 93.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 08:59:48,718 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.95ms. Allocated memory is still 123.7MB. Free memory was 78.7MB in the beginning and 68.7MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 08:59:48,718 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.43ms. Allocated memory is still 123.7MB. Free memory was 68.7MB in the beginning and 67.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 08:59:48,718 INFO L158 Benchmark]: Boogie Preprocessor took 32.80ms. Allocated memory is still 123.7MB. Free memory was 67.4MB in the beginning and 66.6MB in the end (delta: 768.2kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 08:59:48,719 INFO L158 Benchmark]: RCFGBuilder took 310.23ms. Allocated memory is still 123.7MB. Free memory was 66.2MB in the beginning and 56.9MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-18 08:59:48,719 INFO L158 Benchmark]: BuchiAutomizer took 243593.87ms. Allocated memory was 123.7MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 56.9MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 920.2MB. Max. memory is 16.1GB. [2023-02-18 08:59:48,720 INFO L158 Benchmark]: Witness Printer took 6.22ms. Allocated memory is still 3.1GB. Free memory is still 2.1GB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 08:59:48,721 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 123.7MB. Free memory is still 93.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 220.95ms. Allocated memory is still 123.7MB. Free memory was 78.7MB in the beginning and 68.7MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.43ms. Allocated memory is still 123.7MB. Free memory was 68.7MB in the beginning and 67.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.80ms. Allocated memory is still 123.7MB. Free memory was 67.4MB in the beginning and 66.6MB in the end (delta: 768.2kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 310.23ms. Allocated memory is still 123.7MB. Free memory was 66.2MB in the beginning and 56.9MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 243593.87ms. Allocated memory was 123.7MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 56.9MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 920.2MB. Max. memory is 16.1GB. * Witness Printer took 6.22ms. Allocated memory is still 3.1GB. Free memory is still 2.1GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 18 terminating modules (12 trivial, 4 deterministic, 2 nondeterministic). One deterministic module has affine ranking function -2 * \old(n) + 1 and consists of 4 locations. One deterministic module has affine ranking function n and consists of 8 locations. One deterministic module has affine ranking function m and consists of 10 locations. One deterministic module has affine ranking function m and consists of 8 locations. One nondeterministic module has affine ranking function n and consists of 8 locations. One nondeterministic module has affine ranking function \old(n) and consists of 15 locations. 12 modules have a trivial ranking function, the largest among these consists of 49 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 243.5s and 18 iterations. TraceHistogramMax:1341. Analysis of lassos took 233.6s. Construction of modules took 3.4s. Büchi inclusion checks took 6.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 17. Automata minimization 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 280 StatesRemovedByMinimization, 16 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 3, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 7/12 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1387 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1345 mSDsluCounter, 2141 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1687 mSDsCounter, 2096 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5387 IncrementalHoareTripleChecker+Invalid, 7483 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2096 mSolverCounterUnsat, 454 mSDtfsCounter, 5387 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT1 conc0 concLT1 SILN2 SILU0 SILI6 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital52 mio100 ax100 hnf100 lsp51 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq191 hnf93 smp100 dnf189 smp100 tf103 neg93 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 211ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 4 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 72 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 43 LassoNonterminationAnalysisSatUnbounded: 6 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 4.6s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2023-02-18 08:59:48,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (166)] Ended with exit code 0 [2023-02-18 08:59:48,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (165)] Forceful destruction successful, exit code 0 [2023-02-18 08:59:49,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (164)] Forceful destruction successful, exit code 0 [2023-02-18 08:59:49,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (163)] Ended with exit code 0 [2023-02-18 08:59:49,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (162)] Ended with exit code 0 [2023-02-18 08:59:49,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (161)] Forceful destruction successful, exit code 0 [2023-02-18 08:59:49,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (160)] Ended with exit code 0 [2023-02-18 08:59:50,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (159)] Ended with exit code 0 [2023-02-18 08:59:50,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (158)] Ended with exit code 0 [2023-02-18 08:59:50,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (157)] Ended with exit code 0 [2023-02-18 08:59:50,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (156)] Ended with exit code 0 [2023-02-18 08:59:50,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (135)] Ended with exit code 0 [2023-02-18 08:59:51,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (134)] Ended with exit code 0 [2023-02-18 08:59:51,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (133)] Forceful destruction successful, exit code 0 [2023-02-18 08:59:51,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Ended with exit code 0 [2023-02-18 08:59:51,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Forceful destruction successful, exit code 0 [2023-02-18 08:59:51,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Forceful destruction successful, exit code 0 [2023-02-18 08:59:52,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE