./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/recursive/Ackermann02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 20ed64ec 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/recursive/Ackermann02.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.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 32bit --witnessprinter.graph.data.programhash 035ba3eae82c1904e7a9c5ede20dafeb782b642c .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 16:27:22,793 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 16:27:22,795 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 16:27:22,836 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 16:27:22,836 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 16:27:22,840 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 16:27:22,841 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 16:27:22,846 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 16:27:22,854 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 16:27:22,855 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 16:27:22,856 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 16:27:22,857 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 16:27:22,857 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 16:27:22,858 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 16:27:22,859 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 16:27:22,860 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 16:27:22,861 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 16:27:22,864 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 16:27:22,866 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 16:27:22,870 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 16:27:22,871 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 16:27:22,873 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 16:27:22,877 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 16:27:22,877 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 16:27:22,884 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 16:27:22,884 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 16:27:22,884 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 16:27:22,885 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 16:27:22,885 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 16:27:22,886 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 16:27:22,886 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 16:27:22,887 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 16:27:22,887 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 16:27:22,888 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 16:27:22,889 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 16:27:22,889 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 16:27:22,889 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 16:27:22,890 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 16:27:22,890 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 16:27:22,891 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 16:27:22,891 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 16:27:22,896 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-27 16:27:22,929 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 16:27:22,929 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 16:27:22,930 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 16:27:22,930 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 16:27:22,932 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 16:27:22,932 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 16:27:22,932 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 16:27:22,933 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 16:27:22,933 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 16:27:22,933 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 16:27:22,934 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 16:27:22,934 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 16:27:22,934 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 16:27:22,934 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 16:27:22,934 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 16:27:22,934 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 16:27:22,935 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 16:27:22,935 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 16:27:22,935 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 16:27:22,935 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 16:27:22,935 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 16:27:22,935 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 16:27:22,935 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 16:27:22,936 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 16:27:22,936 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 16:27:22,936 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 16:27:22,936 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 16:27:22,936 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 16:27:22,936 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 16:27:22,936 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 16:27:22,937 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 16:27:22,937 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 16:27:22,938 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 16:27:22,938 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 035ba3eae82c1904e7a9c5ede20dafeb782b642c [2021-08-27 16:27:23,241 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 16:27:23,258 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 16:27:23,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 16:27:23,261 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 16:27:23,261 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 16:27:23,262 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Ackermann02.c [2021-08-27 16:27:23,318 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3130d735/38e66fc06f6d4eb9a8d70b4f3a7bbc5e/FLAG1e0da7ff9 [2021-08-27 16:27:23,805 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 16:27:23,806 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann02.c [2021-08-27 16:27:23,812 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3130d735/38e66fc06f6d4eb9a8d70b4f3a7bbc5e/FLAG1e0da7ff9 [2021-08-27 16:27:24,294 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3130d735/38e66fc06f6d4eb9a8d70b4f3a7bbc5e [2021-08-27 16:27:24,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 16:27:24,300 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 16:27:24,301 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 16:27:24,302 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 16:27:24,305 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 16:27:24,305 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:27:24" (1/1) ... [2021-08-27 16:27:24,306 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c4bf2b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:27:24, skipping insertion in model container [2021-08-27 16:27:24,306 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:27:24" (1/1) ... [2021-08-27 16:27:24,312 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 16:27:24,325 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 16:27:24,464 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann02.c[1157,1170] [2021-08-27 16:27:24,465 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 16:27:24,473 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 16:27:24,486 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann02.c[1157,1170] [2021-08-27 16:27:24,486 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 16:27:24,497 INFO L208 MainTranslator]: Completed translation [2021-08-27 16:27:24,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:27:24 WrapperNode [2021-08-27 16:27:24,498 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 16:27:24,499 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 16:27:24,499 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 16:27:24,499 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 16:27:24,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:27:24" (1/1) ... [2021-08-27 16:27:24,510 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:27:24" (1/1) ... [2021-08-27 16:27:24,528 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 16:27:24,529 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 16:27:24,529 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 16:27:24,529 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 16:27:24,541 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:27:24" (1/1) ... [2021-08-27 16:27:24,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:27:24" (1/1) ... [2021-08-27 16:27:24,560 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:27:24" (1/1) ... [2021-08-27 16:27:24,560 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:27:24" (1/1) ... [2021-08-27 16:27:24,569 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:27:24" (1/1) ... [2021-08-27 16:27:24,571 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:27:24" (1/1) ... [2021-08-27 16:27:24,572 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:27:24" (1/1) ... [2021-08-27 16:27:24,576 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 16:27:24,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 16:27:24,577 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 16:27:24,577 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 16:27:24,578 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:27:24" (1/1) ... [2021-08-27 16:27:24,583 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:24,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:24,618 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) [2021-08-27 16:27:24,639 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 [2021-08-27 16:27:24,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 16:27:24,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 16:27:24,671 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2021-08-27 16:27:24,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2021-08-27 16:27:24,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 16:27:24,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 16:27:24,939 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 16:27:24,940 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-08-27 16:27:24,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:27:24 BoogieIcfgContainer [2021-08-27 16:27:24,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 16:27:24,942 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 16:27:24,942 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 16:27:24,959 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 16:27:24,960 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 16:27:24,960 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 04:27:24" (1/3) ... [2021-08-27 16:27:24,961 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1fc00f9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 04:27:24, skipping insertion in model container [2021-08-27 16:27:24,961 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 16:27:24,961 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:27:24" (2/3) ... [2021-08-27 16:27:24,962 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1fc00f9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 04:27:24, skipping insertion in model container [2021-08-27 16:27:24,962 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 16:27:24,962 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:27:24" (3/3) ... [2021-08-27 16:27:24,963 INFO L389 chiAutomizerObserver]: Analyzing ICFG Ackermann02.c [2021-08-27 16:27:25,041 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 16:27:25,041 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 16:27:25,041 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 16:27:25,041 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 16:27:25,041 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 16:27:25,041 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 16:27:25,042 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 16:27:25,042 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 16:27:25,056 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) [2021-08-27 16:27:25,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-08-27 16:27:25,076 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:27:25,076 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:27:25,081 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-08-27 16:27:25,081 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 16:27:25,081 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 16:27:25,082 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) [2021-08-27 16:27:25,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-08-27 16:27:25,087 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:27:25,087 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:27:25,088 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-08-27 16:27:25,088 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 16:27:25,094 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 9#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet10;havoc main_#t~nondet10; 8#L29true assume !(main_~m~0 < 0 || main_~m~0 > 3);main_~n~0 := main_#t~nondet11;havoc main_#t~nondet11; 22#L35true assume !(main_~n~0 < 0 || main_~n~0 > 23); 16#L41true call main_#t~ret12 := ackermann(main_~m~0, main_~n~0);< 6#ackermannENTRYtrue [2021-08-27 16:27:25,094 INFO L793 eck$LassoCheckResult]: Loop: 6#ackermannENTRYtrue ~m := #in~m;~n := #in~n; 13#L17true assume !(0 == ~m); 14#L20true assume 0 == ~n; 17#L21true call #t~ret7 := ackermann(~m - 1, 1);< 6#ackermannENTRYtrue [2021-08-27 16:27:25,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:27:25,099 INFO L82 PathProgramCache]: Analyzing trace with hash 28695872, now seen corresponding path program 1 times [2021-08-27 16:27:25,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:27:25,109 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785408799] [2021-08-27 16:27:25,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:27:25,110 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:27:25,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:27:25,193 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:27:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:27:25,223 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:27:25,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:27:25,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1697199, now seen corresponding path program 1 times [2021-08-27 16:27:25,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:27:25,226 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492158438] [2021-08-27 16:27:25,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:27:25,226 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:27:25,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:27:25,231 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:27:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:27:25,235 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:27:25,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:27:25,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1292962670, now seen corresponding path program 1 times [2021-08-27 16:27:25,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:27:25,236 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107706023] [2021-08-27 16:27:25,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:27:25,237 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:27:25,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:27:25,254 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:27:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:27:25,273 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:27:25,487 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 16:27:25,488 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 16:27:25,488 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 16:27:25,488 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 16:27:25,488 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-27 16:27:25,488 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:25,489 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 16:27:25,489 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 16:27:25,489 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann02.c_Iteration1_Loop [2021-08-27 16:27:25,489 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 16:27:25,490 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 16:27:25,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:25,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:25,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:25,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:25,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:25,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:25,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:25,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:25,692 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 16:27:25,692 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-27 16:27:25,694 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:25,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:25,696 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) [2021-08-27 16:27:25,709 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:25,709 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:25,724 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 [2021-08-27 16:27:25,744 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:27:25,744 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~m=0} Honda state: {ackermann_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:27:25,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-08-27 16:27:25,772 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:25,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:25,774 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) [2021-08-27 16:27:25,775 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 [2021-08-27 16:27:25,777 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:25,777 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:25,809 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:27:25,809 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret9=0} Honda state: {ackermann_#t~ret9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:27:25,835 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 [2021-08-27 16:27:25,836 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:25,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:25,838 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) [2021-08-27 16:27:25,840 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 [2021-08-27 16:27:25,842 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:25,844 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:25,866 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:27:25,867 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret8=0} Honda state: {ackermann_#t~ret8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:27:25,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-08-27 16:27:25,895 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:25,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:25,896 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) [2021-08-27 16:27:25,908 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:25,909 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:25,920 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 [2021-08-27 16:27:25,937 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:27:25,937 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=0} Honda state: {ackermann_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:27:25,963 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 [2021-08-27 16:27:25,964 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:25,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:25,965 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) [2021-08-27 16:27:25,967 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 [2021-08-27 16:27:25,968 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:25,969 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:25,993 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:27:25,993 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret7=0} Honda state: {ackermann_#t~ret7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:27:26,023 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 [2021-08-27 16:27:26,024 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:26,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:26,025 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) [2021-08-27 16:27:26,027 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 [2021-08-27 16:27:26,028 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:26,028 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:26,053 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:27:26,053 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:27:26,080 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 [2021-08-27 16:27:26,080 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:26,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:26,081 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) [2021-08-27 16:27:26,092 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:26,092 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:26,099 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 [2021-08-27 16:27:26,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-08-27 16:27:26,126 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:26,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:26,127 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) [2021-08-27 16:27:26,128 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 [2021-08-27 16:27:26,132 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-27 16:27:26,132 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:26,162 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-27 16:27:26,187 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 [2021-08-27 16:27:26,187 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 16:27:26,188 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 16:27:26,188 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 16:27:26,188 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 16:27:26,188 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 16:27:26,188 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:26,188 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 16:27:26,188 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 16:27:26,188 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann02.c_Iteration1_Loop [2021-08-27 16:27:26,188 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 16:27:26,188 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 16:27:26,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:26,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:26,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:26,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:26,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:26,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:26,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:26,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:26,429 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 16:27:26,433 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 16:27:26,434 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:26,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:26,435 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) [2021-08-27 16:27:26,443 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 [2021-08-27 16:27:26,447 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 [2021-08-27 16:27:26,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:26,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:26,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:26,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:26,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:26,456 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:26,456 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:26,468 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:26,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2021-08-27 16:27:26,483 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:26,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:26,484 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) [2021-08-27 16:27:26,486 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 [2021-08-27 16:27:26,487 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 [2021-08-27 16:27:26,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:26,495 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:26,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:26,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:26,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:26,496 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:26,496 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:26,510 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:26,527 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 [2021-08-27 16:27:26,528 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:26,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:26,529 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) [2021-08-27 16:27:26,529 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 [2021-08-27 16:27:26,531 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 [2021-08-27 16:27:26,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:26,538 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:26,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:26,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:26,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:26,538 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:26,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:26,540 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:26,555 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 [2021-08-27 16:27:26,555 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:26,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:26,556 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) [2021-08-27 16:27:26,557 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 [2021-08-27 16:27:26,559 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 [2021-08-27 16:27:26,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:26,566 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:26,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:26,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:26,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:26,570 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:26,570 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:26,571 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:26,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2021-08-27 16:27:26,587 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:26,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:26,588 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) [2021-08-27 16:27:26,599 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 [2021-08-27 16:27:26,600 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 [2021-08-27 16:27:26,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:26,607 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:26,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:26,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:26,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:26,608 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:26,608 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:26,613 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:26,629 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 [2021-08-27 16:27:26,631 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:26,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:26,631 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) [2021-08-27 16:27:26,632 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 [2021-08-27 16:27:26,634 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 [2021-08-27 16:27:26,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:26,640 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:26,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:26,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:26,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:26,642 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:26,642 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:26,644 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 16:27:26,648 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-08-27 16:27:26,648 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-08-27 16:27:26,649 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:26,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:26,650 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) [2021-08-27 16:27:26,651 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 [2021-08-27 16:27:26,652 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 16:27:26,652 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-08-27 16:27:26,652 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 16:27:26,653 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ackermann_#in~n) = -2*ackermann_#in~n + 1 Supporting invariants [] [2021-08-27 16:27:26,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2021-08-27 16:27:26,673 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-08-27 16:27:26,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:27:26,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:26,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 16:27:26,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:27:26,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:26,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 16:27:26,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:27:26,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:27:26,913 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2021-08-27 16:27:26,914 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) [2021-08-27 16:27:27,023 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 [2021-08-27 16:27:27,045 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. [2021-08-27 16:27:27,046 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 [2021-08-27 16:27:27,047 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) [2021-08-27 16:27:27,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2021-08-27 16:27:27,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 4 letters. [2021-08-27 16:27:27,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:27:27,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2021-08-27 16:27:27,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:27:27,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 8 letters. [2021-08-27 16:27:27,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:27:27,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 65 transitions. [2021-08-27 16:27:27,055 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-08-27 16:27:27,060 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 29 states and 37 transitions. [2021-08-27 16:27:27,061 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-08-27 16:27:27,061 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2021-08-27 16:27:27,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2021-08-27 16:27:27,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:27:27,062 INFO L681 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2021-08-27 16:27:27,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2021-08-27 16:27:27,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2021-08-27 16:27:27,080 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) [2021-08-27 16:27:27,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2021-08-27 16:27:27,082 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2021-08-27 16:27:27,082 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2021-08-27 16:27:27,082 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 16:27:27,083 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2021-08-27 16:27:27,084 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-08-27 16:27:27,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:27:27,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:27:27,084 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:27:27,084 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 16:27:27,085 INFO L791 eck$LassoCheckResult]: Stem: 133#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 134#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet10;havoc main_#t~nondet10; 146#L29 assume !(main_~m~0 < 0 || main_~m~0 > 3);main_~n~0 := main_#t~nondet11;havoc main_#t~nondet11; 147#L35 assume !(main_~n~0 < 0 || main_~n~0 > 23); 136#L41 call main_#t~ret12 := ackermann(main_~m~0, main_~n~0);< 135#ackermannENTRY ~m := #in~m;~n := #in~n; 138#L17 assume !(0 == ~m); 151#L20 assume !(0 == ~n); 142#L23 [2021-08-27 16:27:27,085 INFO L793 eck$LassoCheckResult]: Loop: 142#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 150#ackermannENTRY ~m := #in~m;~n := #in~n; 153#L17 assume !(0 == ~m); 154#L20 assume !(0 == ~n); 142#L23 [2021-08-27 16:27:27,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:27:27,085 INFO L82 PathProgramCache]: Analyzing trace with hash 180255807, now seen corresponding path program 1 times [2021-08-27 16:27:27,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:27:27,086 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937419796] [2021-08-27 16:27:27,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:27:27,086 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:27:27,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:27:27,098 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:27:27,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:27:27,110 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:27:27,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:27:27,111 INFO L82 PathProgramCache]: Analyzing trace with hash 2259284, now seen corresponding path program 1 times [2021-08-27 16:27:27,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:27:27,112 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47016175] [2021-08-27 16:27:27,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:27:27,112 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:27:27,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:27:27,116 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:27:27,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:27:27,119 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:27:27,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:27:27,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1387046546, now seen corresponding path program 1 times [2021-08-27 16:27:27,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:27:27,120 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350398631] [2021-08-27 16:27:27,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:27:27,121 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:27:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:27:27,132 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:27:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:27:27,147 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:27:27,338 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 16:27:27,338 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 16:27:27,338 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 16:27:27,338 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 16:27:27,339 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-27 16:27:27,339 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:27,339 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 16:27:27,339 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 16:27:27,339 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann02.c_Iteration2_Loop [2021-08-27 16:27:27,339 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 16:27:27,339 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 16:27:27,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:27,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:27,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:27,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:27,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:27,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:27,512 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 16:27:27,512 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-27 16:27:27,513 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:27,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:27,514 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) [2021-08-27 16:27:27,515 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 [2021-08-27 16:27:27,519 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:27,519 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:27,541 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:27:27,541 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~m=7, ackermann_~m=7} Honda state: {ackermann_#in~m=7, ackermann_~m=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:27:27,565 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 [2021-08-27 16:27:27,566 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:27,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:27,567 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) [2021-08-27 16:27:27,571 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 [2021-08-27 16:27:27,572 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:27,572 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:27,597 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:27:27,597 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret8=0} Honda state: {ackermann_#t~ret8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:27:27,623 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 [2021-08-27 16:27:27,623 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:27,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:27,625 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) [2021-08-27 16:27:27,632 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:27,633 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:27,656 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 [2021-08-27 16:27:27,691 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 [2021-08-27 16:27:27,691 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:27,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:27,693 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) [2021-08-27 16:27:27,703 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 [2021-08-27 16:27:27,703 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-27 16:27:27,704 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:30,279 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:27:30,279 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=-1, ackermann_#in~n=1} Honda state: {ackermann_~n=-1, ackermann_#in~n=1} Generalized eigenvectors: [{ackermann_~n=-1, ackermann_#in~n=7}, {ackermann_~n=0, ackermann_#in~n=-8}, {ackermann_~n=0, ackermann_#in~n=-2}] Lambdas: [1, 0, 0] Nus: [1, 0] [2021-08-27 16:27:30,296 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 [2021-08-27 16:27:30,297 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:30,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:30,298 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) [2021-08-27 16:27:30,335 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:30,335 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:30,345 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 [2021-08-27 16:27:30,357 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:27:30,357 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret9=0} Honda state: {ackermann_#t~ret9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:27:30,381 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 [2021-08-27 16:27:30,381 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:30,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:30,385 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) [2021-08-27 16:27:30,387 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 [2021-08-27 16:27:30,388 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:30,388 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:30,410 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:27:30,410 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret7=0} Honda state: {ackermann_#t~ret7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:27:30,426 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 [2021-08-27 16:27:30,427 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:30,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:30,428 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) [2021-08-27 16:27:30,429 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 [2021-08-27 16:27:30,430 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:30,430 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:30,438 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:27:30,438 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:27:30,454 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 [2021-08-27 16:27:31,104 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 16:27:31,105 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 16:27:31,105 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 16:27:31,105 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 16:27:31,105 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 16:27:31,105 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:31,105 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 16:27:31,105 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 16:27:31,106 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann02.c_Iteration2_Lasso [2021-08-27 16:27:31,106 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 16:27:31,106 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 16:27:31,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:31,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:31,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:31,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:31,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:31,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:31,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:31,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:31,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:31,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:31,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:31,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:31,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:31,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:31,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:31,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:31,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:31,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:31,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:31,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:31,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:31,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:31,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:31,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:31,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:31,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:31,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:31,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:31,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:31,574 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 16:27:31,575 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 16:27:31,575 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:31,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:31,582 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) [2021-08-27 16:27:31,589 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 [2021-08-27 16:27:31,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:31,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:31,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:31,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:31,601 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 16:27:31,601 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 16:27:31,604 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 [2021-08-27 16:27:31,614 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:31,631 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 [2021-08-27 16:27:31,632 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:31,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:31,633 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) [2021-08-27 16:27:31,633 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 [2021-08-27 16:27:31,635 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 [2021-08-27 16:27:31,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:31,641 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:31,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:31,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:31,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:31,642 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:31,642 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:31,643 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:31,661 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 [2021-08-27 16:27:31,661 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:31,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:31,662 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) [2021-08-27 16:27:31,663 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 [2021-08-27 16:27:31,664 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 [2021-08-27 16:27:31,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:31,671 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:31,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:31,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:31,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:31,672 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:31,672 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:31,673 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:31,690 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 [2021-08-27 16:27:31,691 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:31,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:31,691 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) [2021-08-27 16:27:31,692 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 [2021-08-27 16:27:31,694 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 [2021-08-27 16:27:31,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:31,700 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:31,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:31,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:31,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:31,701 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:31,701 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:31,702 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:31,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2021-08-27 16:27:31,717 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:31,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:31,718 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) [2021-08-27 16:27:31,719 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 [2021-08-27 16:27:31,720 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 [2021-08-27 16:27:31,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:31,727 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:31,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:31,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:31,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:31,728 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:31,728 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:31,731 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:31,748 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 [2021-08-27 16:27:31,749 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:31,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:31,749 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) [2021-08-27 16:27:31,751 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 [2021-08-27 16:27:31,751 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 [2021-08-27 16:27:31,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:31,758 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:31,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:31,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:31,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:31,758 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:31,758 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:31,784 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:31,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2021-08-27 16:27:31,810 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:31,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:31,811 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) [2021-08-27 16:27:31,812 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 [2021-08-27 16:27:31,813 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 [2021-08-27 16:27:31,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:31,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:31,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:31,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:31,821 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 16:27:31,821 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 16:27:31,830 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:31,848 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 [2021-08-27 16:27:31,850 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:31,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:31,851 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) [2021-08-27 16:27:31,852 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 [2021-08-27 16:27:31,853 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 [2021-08-27 16:27:31,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:31,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:31,859 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-08-27 16:27:31,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:31,870 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2021-08-27 16:27:31,870 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2021-08-27 16:27:31,900 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:31,923 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 [2021-08-27 16:27:31,923 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:31,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:31,924 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) [2021-08-27 16:27:31,924 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 [2021-08-27 16:27:31,925 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 [2021-08-27 16:27:31,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:31,932 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:31,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:31,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:31,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:31,933 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:31,933 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:31,945 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:31,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2021-08-27 16:27:31,961 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:31,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:31,962 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) [2021-08-27 16:27:31,963 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 [2021-08-27 16:27:31,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 [2021-08-27 16:27:31,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:31,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:31,970 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-08-27 16:27:31,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:31,983 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2021-08-27 16:27:31,983 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2021-08-27 16:27:32,013 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 16:27:32,032 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2021-08-27 16:27:32,032 INFO L444 ModelExtractionUtils]: 6 out of 16 variables were initially zero. Simplification set additionally 6 variables to zero. [2021-08-27 16:27:32,033 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:32,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:32,034 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) [2021-08-27 16:27:32,034 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 [2021-08-27 16:27:32,035 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 16:27:32,044 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2021-08-27 16:27:32,044 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 16:27:32,044 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ackermann_~n) = 1*ackermann_~n Supporting invariants [2*ackermann_~n - 1 >= 0] [2021-08-27 16:27:32,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2021-08-27 16:27:32,086 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2021-08-27 16:27:32,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:27:32,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:32,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 16:27:32,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:27:32,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:32,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 16:27:32,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:27:32,256 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 [2021-08-27 16:27:32,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:27:32,315 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2021-08-27 16:27:32,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) [2021-08-27 16:27:32,381 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. [2021-08-27 16:27:32,383 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 [2021-08-27 16:27:32,383 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) [2021-08-27 16:27:32,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 12 transitions. [2021-08-27 16:27:32,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 12 transitions. Stem has 8 letters. Loop has 4 letters. [2021-08-27 16:27:32,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:27:32,384 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-08-27 16:27:32,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:27:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:32,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 16:27:32,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:27:32,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:32,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 16:27:32,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:27:32,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:27:32,593 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 3 loop predicates [2021-08-27 16:27:32,593 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) [2021-08-27 16:27:32,693 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. [2021-08-27 16:27:32,694 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 [2021-08-27 16:27:32,694 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) [2021-08-27 16:27:32,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 18 transitions. [2021-08-27 16:27:32,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 8 letters. Loop has 4 letters. [2021-08-27 16:27:32,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:27:32,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 12 letters. Loop has 4 letters. [2021-08-27 16:27:32,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:27:32,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 8 letters. Loop has 8 letters. [2021-08-27 16:27:32,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:27:32,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 67 transitions. [2021-08-27 16:27:32,699 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-08-27 16:27:32,700 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 42 states and 59 transitions. [2021-08-27 16:27:32,701 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2021-08-27 16:27:32,701 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2021-08-27 16:27:32,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 59 transitions. [2021-08-27 16:27:32,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:27:32,701 INFO L681 BuchiCegarLoop]: Abstraction has 42 states and 59 transitions. [2021-08-27 16:27:32,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 59 transitions. [2021-08-27 16:27:32,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2021-08-27 16:27:32,705 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) [2021-08-27 16:27:32,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2021-08-27 16:27:32,706 INFO L704 BuchiCegarLoop]: Abstraction has 33 states and 45 transitions. [2021-08-27 16:27:32,706 INFO L587 BuchiCegarLoop]: Abstraction has 33 states and 45 transitions. [2021-08-27 16:27:32,706 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 16:27:32,706 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 45 transitions. [2021-08-27 16:27:32,707 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-08-27 16:27:32,707 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:27:32,707 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:27:32,708 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:27:32,708 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 16:27:32,708 INFO L791 eck$LassoCheckResult]: Stem: 420#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 421#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet10;havoc main_#t~nondet10; 432#L29 assume !(main_~m~0 < 0 || main_~m~0 > 3);main_~n~0 := main_#t~nondet11;havoc main_#t~nondet11; 433#L35 assume !(main_~n~0 < 0 || main_~n~0 > 23); 423#L41 call main_#t~ret12 := ackermann(main_~m~0, main_~n~0);< 422#ackermannENTRY ~m := #in~m;~n := #in~n; 425#L17 assume !(0 == ~m); 440#L20 assume !(0 == ~n); 429#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 446#ackermannENTRY ~m := #in~m;~n := #in~n; 452#L17 assume !(0 == ~m); 436#L20 assume 0 == ~n; 437#L21 [2021-08-27 16:27:32,708 INFO L793 eck$LassoCheckResult]: Loop: 437#L21 call #t~ret7 := ackermann(~m - 1, 1);< 439#ackermannENTRY ~m := #in~m;~n := #in~n; 450#L17 assume !(0 == ~m); 451#L20 assume 0 == ~n; 437#L21 [2021-08-27 16:27:32,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:27:32,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1387046543, now seen corresponding path program 1 times [2021-08-27 16:27:32,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:27:32,709 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578983825] [2021-08-27 16:27:32,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:27:32,709 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:27:32,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:27:32,722 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:27:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:27:32,735 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:27:32,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:27:32,736 INFO L82 PathProgramCache]: Analyzing trace with hash 2199699, now seen corresponding path program 2 times [2021-08-27 16:27:32,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:27:32,737 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122341571] [2021-08-27 16:27:32,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:27:32,737 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:27:32,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:32,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:27:32,768 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:27:32,768 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122341571] [2021-08-27 16:27:32,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122341571] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:27:32,769 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:27:32,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 16:27:32,769 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126407166] [2021-08-27 16:27:32,771 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:27:32,771 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:27:32,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 16:27:32,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 16:27:32,775 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) [2021-08-27 16:27:32,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:27:32,807 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2021-08-27 16:27:32,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 16:27:32,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 63 transitions. [2021-08-27 16:27:32,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2021-08-27 16:27:32,812 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 45 states and 61 transitions. [2021-08-27 16:27:32,812 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2021-08-27 16:27:32,812 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2021-08-27 16:27:32,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 61 transitions. [2021-08-27 16:27:32,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:27:32,812 INFO L681 BuchiCegarLoop]: Abstraction has 45 states and 61 transitions. [2021-08-27 16:27:32,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 61 transitions. [2021-08-27 16:27:32,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2021-08-27 16:27:32,816 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) [2021-08-27 16:27:32,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2021-08-27 16:27:32,817 INFO L704 BuchiCegarLoop]: Abstraction has 44 states and 60 transitions. [2021-08-27 16:27:32,817 INFO L587 BuchiCegarLoop]: Abstraction has 44 states and 60 transitions. [2021-08-27 16:27:32,817 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 16:27:32,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 60 transitions. [2021-08-27 16:27:32,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2021-08-27 16:27:32,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:27:32,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:27:32,819 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:27:32,819 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2021-08-27 16:27:32,819 INFO L791 eck$LassoCheckResult]: Stem: 509#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 510#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet10;havoc main_#t~nondet10; 521#L29 assume !(main_~m~0 < 0 || main_~m~0 > 3);main_~n~0 := main_#t~nondet11;havoc main_#t~nondet11; 522#L35 assume !(main_~n~0 < 0 || main_~n~0 > 23); 531#L41 call main_#t~ret12 := ackermann(main_~m~0, main_~n~0);< 532#ackermannENTRY ~m := #in~m;~n := #in~n; 546#L17 assume !(0 == ~m); 549#L20 assume !(0 == ~n); 516#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 538#ackermannENTRY ~m := #in~m;~n := #in~n; 551#L17 assume !(0 == ~m); 547#L20 assume 0 == ~n; 528#L21 [2021-08-27 16:27:32,819 INFO L793 eck$LassoCheckResult]: Loop: 528#L21 call #t~ret7 := ackermann(~m - 1, 1);< 540#ackermannENTRY ~m := #in~m;~n := #in~n; 544#L17 assume !(0 == ~m); 527#L20 assume !(0 == ~n); 529#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 530#ackermannENTRY ~m := #in~m;~n := #in~n; 552#L17 assume !(0 == ~m); 550#L20 assume 0 == ~n; 528#L21 [2021-08-27 16:27:32,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:27:32,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1387046543, now seen corresponding path program 2 times [2021-08-27 16:27:32,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:27:32,820 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277582119] [2021-08-27 16:27:32,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:27:32,820 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:27:32,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:27:32,834 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:27:32,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:27:32,856 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:27:32,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:27:32,857 INFO L82 PathProgramCache]: Analyzing trace with hash -47204506, now seen corresponding path program 1 times [2021-08-27 16:27:32,857 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:27:32,857 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306829056] [2021-08-27 16:27:32,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:27:32,857 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:27:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:27:32,862 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:27:32,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:27:32,871 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:27:32,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:27:32,872 INFO L82 PathProgramCache]: Analyzing trace with hash -2117341196, now seen corresponding path program 1 times [2021-08-27 16:27:32,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:27:32,872 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998120407] [2021-08-27 16:27:32,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:27:32,874 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:27:32,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:27:32,888 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:27:32,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:27:32,905 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:27:33,125 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 16:27:33,126 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 16:27:33,126 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 16:27:33,126 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 16:27:33,126 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-27 16:27:33,126 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:33,126 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 16:27:33,126 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 16:27:33,127 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann02.c_Iteration4_Loop [2021-08-27 16:27:33,127 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 16:27:33,127 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 16:27:33,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:33,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:33,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:33,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:33,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:33,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:33,203 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 16:27:33,203 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-27 16:27:33,203 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:33,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:33,207 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) [2021-08-27 16:27:33,211 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 [2021-08-27 16:27:33,212 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:33,212 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:33,219 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:27:33,219 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret8=0} Honda state: {ackermann_#t~ret8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:27:33,236 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 [2021-08-27 16:27:33,237 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:33,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:33,238 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) [2021-08-27 16:27:33,238 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 [2021-08-27 16:27:33,239 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:33,239 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:33,246 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:27:33,246 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret9=0} Honda state: {ackermann_#t~ret9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:27:33,263 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 [2021-08-27 16:27:33,263 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:33,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:33,264 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) [2021-08-27 16:27:33,265 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 [2021-08-27 16:27:33,266 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:33,266 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:33,285 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:27:33,285 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:27:33,302 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 [2021-08-27 16:27:33,302 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:33,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:33,303 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) [2021-08-27 16:27:33,304 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 [2021-08-27 16:27:33,305 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:33,305 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:33,317 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:27:33,317 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: [] [2021-08-27 16:27:33,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2021-08-27 16:27:33,333 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:33,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:33,333 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) [2021-08-27 16:27:33,334 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 [2021-08-27 16:27:33,335 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:33,335 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:33,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2021-08-27 16:27:33,363 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:33,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:33,364 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) [2021-08-27 16:27:33,367 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 [2021-08-27 16:27:33,368 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-27 16:27:33,368 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:33,566 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:27:33,566 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~m=6, ackermann_~m=-2} Honda state: {ackermann_#in~m=6, ackermann_~m=-2} Generalized eigenvectors: [{ackermann_#in~m=-8, ackermann_~m=0}, {ackermann_#in~m=0, ackermann_~m=0}, {ackermann_#in~m=-1, ackermann_~m=-1}] Lambdas: [0, 6, 1] Nus: [0, 0] [2021-08-27 16:27:33,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2021-08-27 16:27:33,582 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:33,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:33,583 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) [2021-08-27 16:27:33,583 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 [2021-08-27 16:27:33,585 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:33,585 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:33,593 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:27:33,593 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret7=0} Honda state: {ackermann_#t~ret7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:27:33,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2021-08-27 16:27:34,352 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 16:27:34,352 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 16:27:34,352 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 16:27:34,352 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 16:27:34,352 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 16:27:34,352 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:34,352 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 16:27:34,352 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 16:27:34,352 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann02.c_Iteration4_Lasso [2021-08-27 16:27:34,352 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 16:27:34,352 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 16:27:34,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:34,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:34,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:34,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:34,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:34,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:34,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:34,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:34,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:34,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:34,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:34,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:34,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:34,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:34,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:34,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:34,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:34,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:34,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:34,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:34,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:34,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:34,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:34,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:34,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:34,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:34,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:34,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:34,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:34,742 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 16:27:34,742 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 16:27:34,742 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:34,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:34,745 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) [2021-08-27 16:27:34,746 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 [2021-08-27 16:27:34,747 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 [2021-08-27 16:27:34,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:34,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:34,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:34,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:34,757 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 16:27:34,757 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 16:27:34,784 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:34,804 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 [2021-08-27 16:27:34,804 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:34,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:34,805 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) [2021-08-27 16:27:34,806 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 [2021-08-27 16:27:34,807 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 [2021-08-27 16:27:34,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:34,813 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:34,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:34,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:34,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:34,814 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:34,814 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:34,815 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:34,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2021-08-27 16:27:34,831 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:34,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:34,831 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) [2021-08-27 16:27:34,833 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 [2021-08-27 16:27:34,834 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 [2021-08-27 16:27:34,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:34,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:34,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:34,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:34,845 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 16:27:34,845 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 16:27:34,855 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:34,878 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 [2021-08-27 16:27:34,878 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:34,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:34,879 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) [2021-08-27 16:27:34,880 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 [2021-08-27 16:27:34,882 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 [2021-08-27 16:27:34,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:34,889 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:34,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:34,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:34,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:34,890 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:34,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:34,896 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:34,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2021-08-27 16:27:34,919 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:34,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:34,920 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) [2021-08-27 16:27:34,921 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 [2021-08-27 16:27:34,922 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 [2021-08-27 16:27:34,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:34,930 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:34,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:34,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:34,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:34,931 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:34,931 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:34,944 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:34,967 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 [2021-08-27 16:27:34,968 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:34,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:34,968 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) [2021-08-27 16:27:34,970 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 [2021-08-27 16:27:34,971 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 [2021-08-27 16:27:34,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:34,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:34,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:34,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:34,980 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 16:27:34,980 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 16:27:34,994 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:35,016 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 [2021-08-27 16:27:35,017 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:35,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:35,017 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) [2021-08-27 16:27:35,020 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 [2021-08-27 16:27:35,020 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 [2021-08-27 16:27:35,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:35,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:35,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:35,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:35,029 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 16:27:35,029 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 16:27:35,057 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:35,073 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 [2021-08-27 16:27:35,074 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:35,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:35,074 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) [2021-08-27 16:27:35,076 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 [2021-08-27 16:27:35,076 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 [2021-08-27 16:27:35,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:35,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:35,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:35,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:35,084 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 16:27:35,084 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 16:27:35,092 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:35,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2021-08-27 16:27:35,108 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:35,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:35,109 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) [2021-08-27 16:27:35,109 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 [2021-08-27 16:27:35,110 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 [2021-08-27 16:27:35,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:35,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:35,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:35,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:35,118 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 16:27:35,118 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 16:27:35,125 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:35,140 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 [2021-08-27 16:27:35,141 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:35,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:35,141 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) [2021-08-27 16:27:35,142 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 [2021-08-27 16:27:35,143 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 [2021-08-27 16:27:35,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:35,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:35,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:35,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:35,151 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 16:27:35,151 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 16:27:35,157 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:35,172 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 [2021-08-27 16:27:35,172 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:35,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:35,174 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) [2021-08-27 16:27:35,174 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 [2021-08-27 16:27:35,176 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 [2021-08-27 16:27:35,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:35,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:35,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:35,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:35,183 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 16:27:35,183 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 16:27:35,185 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:35,201 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 [2021-08-27 16:27:35,201 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:35,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:35,202 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) [2021-08-27 16:27:35,203 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 [2021-08-27 16:27:35,241 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 [2021-08-27 16:27:35,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:35,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:35,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:35,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:35,249 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 16:27:35,250 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 16:27:35,252 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:35,267 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 [2021-08-27 16:27:35,267 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:35,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:35,268 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) [2021-08-27 16:27:35,269 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 [2021-08-27 16:27:35,270 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 [2021-08-27 16:27:35,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:35,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:35,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:35,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:35,279 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 16:27:35,279 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 16:27:35,281 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:35,296 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 [2021-08-27 16:27:35,297 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:35,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:35,297 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) [2021-08-27 16:27:35,298 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 [2021-08-27 16:27:35,299 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 [2021-08-27 16:27:35,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:35,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:35,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:35,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:35,307 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 16:27:35,307 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 16:27:35,310 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:35,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2021-08-27 16:27:35,325 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:35,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:35,326 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) [2021-08-27 16:27:35,326 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 [2021-08-27 16:27:35,328 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 [2021-08-27 16:27:35,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:35,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:35,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:35,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:35,335 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 16:27:35,335 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 16:27:35,337 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:35,352 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 [2021-08-27 16:27:35,360 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:35,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:35,361 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) [2021-08-27 16:27:35,362 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 [2021-08-27 16:27:35,363 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 [2021-08-27 16:27:35,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:35,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:35,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:35,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:35,377 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 16:27:35,377 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 16:27:35,392 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:35,414 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 [2021-08-27 16:27:35,414 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:35,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:35,415 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) [2021-08-27 16:27:35,416 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 [2021-08-27 16:27:35,417 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 [2021-08-27 16:27:35,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:35,423 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:35,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:35,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:35,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:35,424 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:35,424 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:35,425 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:35,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2021-08-27 16:27:35,441 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:35,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:35,442 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) [2021-08-27 16:27:35,442 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 [2021-08-27 16:27:35,443 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 [2021-08-27 16:27:35,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:35,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:35,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:35,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:35,453 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 16:27:35,454 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 16:27:35,456 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:35,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2021-08-27 16:27:35,472 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:35,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:35,473 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) [2021-08-27 16:27:35,474 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 [2021-08-27 16:27:35,475 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 [2021-08-27 16:27:35,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:35,481 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:35,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:35,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:35,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:35,482 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:35,482 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:35,484 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:35,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2021-08-27 16:27:35,499 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:35,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:35,500 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) [2021-08-27 16:27:35,502 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 [2021-08-27 16:27:35,502 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 [2021-08-27 16:27:35,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:35,509 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:35,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:35,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:35,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:35,509 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:35,509 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:35,510 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:35,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2021-08-27 16:27:35,527 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:35,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:35,528 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) [2021-08-27 16:27:35,528 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 [2021-08-27 16:27:35,529 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 [2021-08-27 16:27:35,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:35,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:35,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:35,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:35,537 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 16:27:35,537 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 16:27:35,539 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:35,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2021-08-27 16:27:35,555 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:35,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:35,556 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) [2021-08-27 16:27:35,557 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 [2021-08-27 16:27:35,558 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 [2021-08-27 16:27:35,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:35,565 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:35,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:35,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:35,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:35,565 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:35,565 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:35,568 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:35,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2021-08-27 16:27:35,584 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:35,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:35,591 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) [2021-08-27 16:27:35,591 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 [2021-08-27 16:27:35,592 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 [2021-08-27 16:27:35,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:35,599 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:35,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:35,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:35,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:35,599 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:35,599 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:35,600 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:35,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2021-08-27 16:27:35,617 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:35,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:35,617 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) [2021-08-27 16:27:35,618 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 [2021-08-27 16:27:35,619 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 [2021-08-27 16:27:35,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:35,626 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:35,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:35,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:35,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:35,626 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:35,627 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:35,640 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:35,656 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 [2021-08-27 16:27:35,656 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:35,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:35,657 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) [2021-08-27 16:27:35,658 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 [2021-08-27 16:27:35,659 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 [2021-08-27 16:27:35,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:35,666 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:35,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:35,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:35,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:35,667 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:35,667 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:35,668 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:35,683 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 [2021-08-27 16:27:35,683 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:35,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:35,684 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) [2021-08-27 16:27:35,684 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 [2021-08-27 16:27:35,685 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 [2021-08-27 16:27:35,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:35,692 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:35,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:35,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:35,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:35,692 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:35,693 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:35,704 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:35,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2021-08-27 16:27:35,720 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:35,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:35,722 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) [2021-08-27 16:27:35,724 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 [2021-08-27 16:27:35,724 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 [2021-08-27 16:27:35,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:35,730 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:35,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:35,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:35,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:35,731 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:35,731 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:35,732 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:35,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2021-08-27 16:27:35,747 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:35,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:35,748 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) [2021-08-27 16:27:35,749 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 [2021-08-27 16:27:35,750 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 [2021-08-27 16:27:35,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:35,756 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:35,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:35,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:35,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:35,757 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:35,757 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:35,760 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:35,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2021-08-27 16:27:35,776 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:35,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:35,777 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) [2021-08-27 16:27:35,780 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 [2021-08-27 16:27:35,781 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 [2021-08-27 16:27:35,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:35,789 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:35,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:35,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:35,789 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:35,790 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:35,790 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:35,791 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:35,806 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 [2021-08-27 16:27:35,806 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:35,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:35,807 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) [2021-08-27 16:27:35,807 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 [2021-08-27 16:27:35,809 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 [2021-08-27 16:27:35,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:35,815 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:35,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:35,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:35,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:35,816 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:35,816 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:35,820 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:35,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2021-08-27 16:27:35,836 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:35,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:35,837 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) [2021-08-27 16:27:35,837 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 [2021-08-27 16:27:35,838 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 [2021-08-27 16:27:35,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:35,845 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:35,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:35,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:35,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:35,845 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:35,845 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:35,846 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:35,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2021-08-27 16:27:35,861 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:35,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:35,862 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) [2021-08-27 16:27:35,862 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 [2021-08-27 16:27:35,864 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 [2021-08-27 16:27:35,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:35,870 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:35,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:35,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:35,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:35,871 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:35,871 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:35,872 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:35,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2021-08-27 16:27:35,888 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:35,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:35,888 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) [2021-08-27 16:27:35,889 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 [2021-08-27 16:27:35,890 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 [2021-08-27 16:27:35,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:35,898 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:35,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:35,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:35,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:35,898 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:35,898 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:35,912 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:35,934 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 [2021-08-27 16:27:35,934 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:35,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:35,935 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) [2021-08-27 16:27:35,936 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 [2021-08-27 16:27:35,938 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 [2021-08-27 16:27:35,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:35,945 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:35,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:35,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:35,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:35,946 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:35,946 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:35,964 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:35,987 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 [2021-08-27 16:27:35,988 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:35,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:35,989 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) [2021-08-27 16:27:35,990 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 [2021-08-27 16:27:35,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 [2021-08-27 16:27:35,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:35,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:35,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:35,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:36,000 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 16:27:36,000 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 16:27:36,015 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:36,031 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 [2021-08-27 16:27:36,031 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:36,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:36,032 INFO L229 MonitoredProcess]: Starting monitored process 77 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) [2021-08-27 16:27:36,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2021-08-27 16:27:36,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 [2021-08-27 16:27:36,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:36,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:36,040 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-08-27 16:27:36,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:36,046 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2021-08-27 16:27:36,046 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2021-08-27 16:27:36,060 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 16:27:36,073 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2021-08-27 16:27:36,073 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2021-08-27 16:27:36,074 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:36,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:36,074 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) [2021-08-27 16:27:36,075 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 [2021-08-27 16:27:36,076 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 16:27:36,085 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2021-08-27 16:27:36,085 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 16:27:36,085 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ackermann_~m) = 1*ackermann_~m Supporting invariants [2*ackermann_~m - 1 >= 0] [2021-08-27 16:27:36,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2021-08-27 16:27:36,129 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2021-08-27 16:27:36,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:27:36,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:36,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-27 16:27:36,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:27:36,293 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 [2021-08-27 16:27:36,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:36,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 16 conjunts are in the unsatisfiable core [2021-08-27 16:27:36,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:27:36,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-27 16:27:36,438 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 4 loop predicates [2021-08-27 16:27:36,438 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) [2021-08-27 16:27:36,542 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. [2021-08-27 16:27:36,542 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 [2021-08-27 16:27:36,543 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) [2021-08-27 16:27:36,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2021-08-27 16:27:36,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 12 letters. Loop has 8 letters. [2021-08-27 16:27:36,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:27:36,543 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-08-27 16:27:36,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:27:36,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:36,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-27 16:27:36,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:27:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:36,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 16 conjunts are in the unsatisfiable core [2021-08-27 16:27:36,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:27:36,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-27 16:27:36,845 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 4 loop predicates [2021-08-27 16:27:36,845 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) [2021-08-27 16:27:37,050 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. [2021-08-27 16:27:37,051 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 [2021-08-27 16:27:37,051 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) [2021-08-27 16:27:37,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 34 transitions. [2021-08-27 16:27:37,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 34 transitions. Stem has 12 letters. Loop has 8 letters. [2021-08-27 16:27:37,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:27:37,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 34 transitions. Stem has 20 letters. Loop has 8 letters. [2021-08-27 16:27:37,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:27:37,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 34 transitions. Stem has 12 letters. Loop has 16 letters. [2021-08-27 16:27:37,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:27:37,053 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 223 transitions. [2021-08-27 16:27:37,057 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2021-08-27 16:27:37,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 115 states and 180 transitions. [2021-08-27 16:27:37,061 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2021-08-27 16:27:37,061 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2021-08-27 16:27:37,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 180 transitions. [2021-08-27 16:27:37,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:27:37,062 INFO L681 BuchiCegarLoop]: Abstraction has 115 states and 180 transitions. [2021-08-27 16:27:37,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 180 transitions. [2021-08-27 16:27:37,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 110. [2021-08-27 16:27:37,075 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) [2021-08-27 16:27:37,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 175 transitions. [2021-08-27 16:27:37,076 INFO L704 BuchiCegarLoop]: Abstraction has 110 states and 175 transitions. [2021-08-27 16:27:37,076 INFO L587 BuchiCegarLoop]: Abstraction has 110 states and 175 transitions. [2021-08-27 16:27:37,076 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-27 16:27:37,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 175 transitions. [2021-08-27 16:27:37,078 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2021-08-27 16:27:37,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:27:37,079 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:27:37,080 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:27:37,080 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 16:27:37,080 INFO L791 eck$LassoCheckResult]: Stem: 1030#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1031#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet10;havoc main_#t~nondet10; 1049#L29 assume !(main_~m~0 < 0 || main_~m~0 > 3);main_~n~0 := main_#t~nondet11;havoc main_#t~nondet11; 1050#L35 assume !(main_~n~0 < 0 || main_~n~0 > 23); 1066#L41 call main_#t~ret12 := ackermann(main_~m~0, main_~n~0);< 1070#ackermannENTRY ~m := #in~m;~n := #in~n; 1098#L17 assume !(0 == ~m); 1099#L20 assume !(0 == ~n); 1034#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 1032#ackermannENTRY ~m := #in~m;~n := #in~n; 1035#L17 assume 0 == ~m;#res := 1 + ~n; 1101#ackermannFINAL assume true; 1051#ackermannEXIT >#45#return; 1041#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 1067#ackermannENTRY [2021-08-27 16:27:37,080 INFO L793 eck$LassoCheckResult]: Loop: 1067#ackermannENTRY ~m := #in~m;~n := #in~n; 1138#L17 assume !(0 == ~m); 1137#L20 assume !(0 == ~n); 1042#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 1067#ackermannENTRY [2021-08-27 16:27:37,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:27:37,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1511844440, now seen corresponding path program 1 times [2021-08-27 16:27:37,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:27:37,081 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674843559] [2021-08-27 16:27:37,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:27:37,081 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:27:37,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:37,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-08-27 16:27:37,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:37,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 16:27:37,126 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:27:37,126 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674843559] [2021-08-27 16:27:37,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674843559] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:27:37,127 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:27:37,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 16:27:37,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327889851] [2021-08-27 16:27:37,127 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:27:37,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:27:37,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1697294, now seen corresponding path program 2 times [2021-08-27 16:27:37,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:27:37,128 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690736270] [2021-08-27 16:27:37,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:27:37,128 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:27:37,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:27:37,132 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:27:37,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:27:37,134 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:27:37,191 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 16:27:37,192 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 16:27:37,192 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 16:27:37,192 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 16:27:37,192 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-27 16:27:37,192 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:37,192 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 16:27:37,192 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 16:27:37,192 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann02.c_Iteration5_Loop [2021-08-27 16:27:37,193 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 16:27:37,193 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 16:27:37,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:37,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:37,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:37,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:37,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:37,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:37,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:37,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:37,268 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 16:27:37,269 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-27 16:27:37,269 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:37,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:37,273 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) [2021-08-27 16:27:37,281 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:37,281 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:37,290 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 [2021-08-27 16:27:37,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2021-08-27 16:27:37,312 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:37,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:37,313 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) [2021-08-27 16:27:37,314 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 [2021-08-27 16:27:37,315 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-27 16:27:37,315 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:37,337 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:27:37,338 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~n=-4} Honda state: {ackermann_#in~n=-4} Generalized eigenvectors: [{ackermann_#in~n=0}, {ackermann_#in~n=-1}, {ackermann_#in~n=0}] Lambdas: [15, 1, 13] Nus: [0, 0] [2021-08-27 16:27:37,353 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 [2021-08-27 16:27:37,353 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:37,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:37,354 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) [2021-08-27 16:27:37,360 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 [2021-08-27 16:27:37,360 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:37,360 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:37,367 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:27:37,367 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~m=0} Honda state: {ackermann_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:27:37,383 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 [2021-08-27 16:27:37,383 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:37,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:37,384 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) [2021-08-27 16:27:37,384 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 [2021-08-27 16:27:37,385 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:37,385 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:37,392 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:27:37,393 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret9=0} Honda state: {ackermann_#t~ret9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:27:37,408 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 [2021-08-27 16:27:37,408 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:37,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:37,409 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) [2021-08-27 16:27:37,409 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 [2021-08-27 16:27:37,410 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:37,410 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:37,431 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:27:37,431 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=0} Honda state: {ackermann_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:27:37,447 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 [2021-08-27 16:27:37,447 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:37,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:37,448 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) [2021-08-27 16:27:37,449 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 [2021-08-27 16:27:37,449 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:37,449 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:37,457 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:27:37,457 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret8=0} Honda state: {ackermann_#t~ret8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:27:37,472 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 [2021-08-27 16:27:37,472 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:37,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:37,473 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) [2021-08-27 16:27:37,474 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 [2021-08-27 16:27:37,475 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:37,475 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:37,503 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:27:37,504 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret7=0} Honda state: {ackermann_#t~ret7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:27:37,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2021-08-27 16:27:37,520 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:37,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:37,520 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) [2021-08-27 16:27:37,521 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 [2021-08-27 16:27:37,522 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:37,523 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:37,530 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:27:37,530 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:27:37,545 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 [2021-08-27 16:27:37,545 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:37,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:37,546 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) [2021-08-27 16:27:37,551 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 [2021-08-27 16:27:37,552 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:37,552 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:37,563 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:27:37,563 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~m=4} Honda state: {ackermann_#in~m=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:27:37,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2021-08-27 16:27:37,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:27:37,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 16:27:37,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 16:27:37,581 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) [2021-08-27 16:27:37,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:27:37,632 INFO L93 Difference]: Finished difference Result 82 states and 111 transitions. [2021-08-27 16:27:37,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 16:27:37,633 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 111 transitions. [2021-08-27 16:27:37,635 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2021-08-27 16:27:37,636 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 76 states and 105 transitions. [2021-08-27 16:27:37,636 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2021-08-27 16:27:37,637 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2021-08-27 16:27:37,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 105 transitions. [2021-08-27 16:27:37,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:27:37,637 INFO L681 BuchiCegarLoop]: Abstraction has 76 states and 105 transitions. [2021-08-27 16:27:37,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 105 transitions. [2021-08-27 16:27:37,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2021-08-27 16:27:37,642 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) [2021-08-27 16:27:37,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 105 transitions. [2021-08-27 16:27:37,643 INFO L704 BuchiCegarLoop]: Abstraction has 76 states and 105 transitions. [2021-08-27 16:27:37,644 INFO L587 BuchiCegarLoop]: Abstraction has 76 states and 105 transitions. [2021-08-27 16:27:37,644 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-27 16:27:37,644 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 105 transitions. [2021-08-27 16:27:37,645 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2021-08-27 16:27:37,645 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:27:37,645 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:27:37,646 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:27:37,646 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 16:27:37,646 INFO L791 eck$LassoCheckResult]: Stem: 1238#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1239#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet10;havoc main_#t~nondet10; 1253#L29 assume !(main_~m~0 < 0 || main_~m~0 > 3);main_~n~0 := main_#t~nondet11;havoc main_#t~nondet11; 1254#L35 assume !(main_~n~0 < 0 || main_~n~0 > 23); 1259#L41 call main_#t~ret12 := ackermann(main_~m~0, main_~n~0);< 1265#ackermannENTRY ~m := #in~m;~n := #in~n; 1301#L17 assume !(0 == ~m); 1299#L20 assume !(0 == ~n); 1272#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 1284#ackermannENTRY ~m := #in~m;~n := #in~n; 1293#L17 assume !(0 == ~m); 1292#L20 assume 0 == ~n; 1244#L21 call #t~ret7 := ackermann(~m - 1, 1);< 1270#ackermannENTRY ~m := #in~m;~n := #in~n; 1305#L17 assume !(0 == ~m); 1294#L20 [2021-08-27 16:27:37,646 INFO L793 eck$LassoCheckResult]: Loop: 1294#L20 assume !(0 == ~n); 1241#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 1240#ackermannENTRY ~m := #in~m;~n := #in~n; 1242#L17 assume !(0 == ~m); 1294#L20 [2021-08-27 16:27:37,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:27:37,647 INFO L82 PathProgramCache]: Analyzing trace with hash -376751137, now seen corresponding path program 2 times [2021-08-27 16:27:37,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:27:37,647 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757134637] [2021-08-27 16:27:37,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:27:37,647 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:27:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:27:37,658 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:27:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:27:37,667 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:27:37,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:27:37,668 INFO L82 PathProgramCache]: Analyzing trace with hash 2009294, now seen corresponding path program 3 times [2021-08-27 16:27:37,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:27:37,668 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669519453] [2021-08-27 16:27:37,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:27:37,669 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:27:37,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:27:37,672 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:27:37,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:27:37,674 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:27:37,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:27:37,674 INFO L82 PathProgramCache]: Analyzing trace with hash 2009908652, now seen corresponding path program 3 times [2021-08-27 16:27:37,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:27:37,675 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20522454] [2021-08-27 16:27:37,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:27:37,675 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:27:37,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:27:37,683 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:27:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:27:37,693 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:27:37,764 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 16:27:37,764 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 16:27:37,764 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 16:27:37,764 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 16:27:37,765 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-27 16:27:37,765 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:37,765 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 16:27:37,765 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 16:27:37,765 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann02.c_Iteration6_Loop [2021-08-27 16:27:37,765 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 16:27:37,765 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 16:27:37,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:37,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:37,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:37,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:37,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:37,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:37,861 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 16:27:37,861 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-27 16:27:37,861 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:37,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:37,862 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) [2021-08-27 16:27:37,865 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:37,865 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:37,874 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 [2021-08-27 16:27:37,883 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:27:37,883 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:27:37,909 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 [2021-08-27 16:27:37,909 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:37,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:37,913 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) [2021-08-27 16:27:37,914 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 [2021-08-27 16:27:37,915 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:37,915 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:37,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2021-08-27 16:27:37,944 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:37,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:37,944 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) [2021-08-27 16:27:37,946 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 [2021-08-27 16:27:37,947 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-27 16:27:37,947 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:37,982 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:27:37,982 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=-4, ackermann_#in~n=-5} Honda state: {ackermann_~n=-4, ackermann_#in~n=-5} Generalized eigenvectors: [{ackermann_~n=-1, ackermann_#in~n=5}, {ackermann_~n=0, ackermann_#in~n=-6}, {ackermann_~n=0, ackermann_#in~n=1}] Lambdas: [1, 0, 0] Nus: [1, 0] [2021-08-27 16:27:37,997 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 [2021-08-27 16:27:37,998 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:37,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:37,998 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) [2021-08-27 16:27:37,999 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 [2021-08-27 16:27:38,000 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:38,000 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:38,007 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:27:38,007 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret8=0} Honda state: {ackermann_#t~ret8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:27:38,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2021-08-27 16:27:38,023 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:38,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:38,024 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) [2021-08-27 16:27:38,025 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 [2021-08-27 16:27:38,025 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:38,025 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:38,032 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:27:38,033 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret7=0} Honda state: {ackermann_#t~ret7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:27:38,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2021-08-27 16:27:38,048 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:38,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:38,049 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) [2021-08-27 16:27:38,049 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 [2021-08-27 16:27:38,050 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:38,050 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:38,063 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:27:38,063 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~m=7, ackermann_~m=7} Honda state: {ackermann_#in~m=7, ackermann_~m=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:27:38,078 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 [2021-08-27 16:27:38,079 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:38,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:38,079 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) [2021-08-27 16:27:38,080 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 [2021-08-27 16:27:38,081 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:38,081 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:38,093 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:27:38,093 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret9=0} Honda state: {ackermann_#t~ret9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:27:38,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2021-08-27 16:27:38,878 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 16:27:38,878 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 16:27:38,878 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 16:27:38,878 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 16:27:38,878 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 16:27:38,878 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:38,878 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 16:27:38,878 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 16:27:38,878 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann02.c_Iteration6_Lasso [2021-08-27 16:27:38,878 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 16:27:38,878 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 16:27:38,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:38,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:38,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:38,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:38,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:38,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:38,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:38,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:38,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:38,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:38,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:38,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:38,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:38,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:38,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:38,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:38,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:38,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:38,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:38,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:38,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:38,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:38,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:38,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:38,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:38,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:39,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:39,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:39,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:39,267 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 16:27:39,267 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 16:27:39,268 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:39,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:39,272 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) [2021-08-27 16:27:39,273 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 [2021-08-27 16:27:39,274 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 [2021-08-27 16:27:39,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:39,281 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:39,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:39,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:39,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:39,281 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:39,281 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:39,282 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:39,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2021-08-27 16:27:39,298 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:39,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:39,299 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) [2021-08-27 16:27:39,300 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 [2021-08-27 16:27:39,301 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 [2021-08-27 16:27:39,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:39,307 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:39,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:39,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:39,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:39,308 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:39,308 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:39,309 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:39,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2021-08-27 16:27:39,324 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:39,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:39,325 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) [2021-08-27 16:27:39,326 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 [2021-08-27 16:27:39,327 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 [2021-08-27 16:27:39,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:39,333 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:39,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:39,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:39,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:39,334 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:39,334 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:39,334 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:39,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2021-08-27 16:27:39,350 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:39,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:39,350 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) [2021-08-27 16:27:39,351 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 [2021-08-27 16:27:39,352 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 [2021-08-27 16:27:39,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:39,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:39,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:39,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:39,360 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 16:27:39,360 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 16:27:39,362 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:39,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2021-08-27 16:27:39,378 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:39,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:39,379 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) [2021-08-27 16:27:39,379 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 [2021-08-27 16:27:39,380 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 [2021-08-27 16:27:39,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:39,387 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:39,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:39,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:39,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:39,387 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:39,388 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:39,388 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:39,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2021-08-27 16:27:39,429 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:39,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:39,430 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) [2021-08-27 16:27:39,472 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 [2021-08-27 16:27:39,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 [2021-08-27 16:27:39,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:39,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:39,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:39,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:39,481 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 16:27:39,481 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 16:27:39,483 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:39,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2021-08-27 16:27:39,499 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:39,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:39,499 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) [2021-08-27 16:27:39,500 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 [2021-08-27 16:27:39,501 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 [2021-08-27 16:27:39,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:39,507 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:39,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:39,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:39,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:39,509 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:39,509 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:39,510 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:39,525 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 [2021-08-27 16:27:39,525 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:39,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:39,526 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) [2021-08-27 16:27:39,527 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 [2021-08-27 16:27:39,527 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 [2021-08-27 16:27:39,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:39,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:39,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:39,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:39,535 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 16:27:39,535 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 16:27:39,542 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:39,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2021-08-27 16:27:39,557 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:39,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:39,558 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) [2021-08-27 16:27:39,559 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 [2021-08-27 16:27:39,560 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 [2021-08-27 16:27:39,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:39,567 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:39,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:39,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:39,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:39,567 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:39,567 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:39,568 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:39,583 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 [2021-08-27 16:27:39,583 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:39,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:39,584 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) [2021-08-27 16:27:39,585 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 [2021-08-27 16:27:39,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 [2021-08-27 16:27:39,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:39,592 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:39,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:39,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:39,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:39,593 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:39,593 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:39,594 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:39,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2021-08-27 16:27:39,609 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:39,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:39,610 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) [2021-08-27 16:27:39,610 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 [2021-08-27 16:27:39,612 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 [2021-08-27 16:27:39,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:39,618 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:39,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:39,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:39,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:39,619 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:39,619 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:39,620 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:39,635 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 [2021-08-27 16:27:39,635 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:39,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:39,636 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) [2021-08-27 16:27:39,637 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 [2021-08-27 16:27:39,638 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 [2021-08-27 16:27:39,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:39,645 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:39,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:39,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:39,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:39,646 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:39,646 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:39,647 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:39,662 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 [2021-08-27 16:27:39,662 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:39,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:39,663 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) [2021-08-27 16:27:39,664 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 [2021-08-27 16:27:39,666 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 [2021-08-27 16:27:39,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:39,672 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:39,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:39,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:39,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:39,672 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:39,672 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:39,673 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:39,688 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 [2021-08-27 16:27:39,689 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:39,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:39,690 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) [2021-08-27 16:27:39,690 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 [2021-08-27 16:27:39,692 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 [2021-08-27 16:27:39,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:39,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:39,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:39,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:39,700 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 16:27:39,700 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 16:27:39,702 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:39,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2021-08-27 16:27:39,717 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:39,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:39,718 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) [2021-08-27 16:27:39,719 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 [2021-08-27 16:27:39,720 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 [2021-08-27 16:27:39,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:39,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:39,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:39,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:39,728 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 16:27:39,728 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 16:27:39,730 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:39,746 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 [2021-08-27 16:27:39,746 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:39,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:39,746 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) [2021-08-27 16:27:39,747 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 [2021-08-27 16:27:39,748 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 [2021-08-27 16:27:39,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:39,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:39,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:39,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:39,758 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 16:27:39,758 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 16:27:39,761 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:39,776 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 [2021-08-27 16:27:39,777 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:39,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:39,777 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) [2021-08-27 16:27:39,778 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 [2021-08-27 16:27:39,779 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 [2021-08-27 16:27:39,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:39,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:39,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:39,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:39,787 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 16:27:39,787 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 16:27:39,789 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:39,804 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 [2021-08-27 16:27:39,804 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:39,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:39,805 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) [2021-08-27 16:27:39,806 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 [2021-08-27 16:27:39,807 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 [2021-08-27 16:27:39,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:39,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:39,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:39,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:39,815 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 16:27:39,815 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 16:27:39,817 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:39,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2021-08-27 16:27:39,832 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:39,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:39,833 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) [2021-08-27 16:27:39,837 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 [2021-08-27 16:27:39,837 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 [2021-08-27 16:27:39,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:39,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:39,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:39,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:39,844 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 16:27:39,845 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 16:27:39,847 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:39,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2021-08-27 16:27:39,862 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:39,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:39,863 INFO L229 MonitoredProcess]: Starting monitored process 114 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) [2021-08-27 16:27:39,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2021-08-27 16:27:39,865 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 [2021-08-27 16:27:39,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:39,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:39,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:39,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:39,874 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 16:27:39,874 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 16:27:39,878 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:39,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Forceful destruction successful, exit code 0 [2021-08-27 16:27:39,895 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:39,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:39,895 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) [2021-08-27 16:27:39,896 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 [2021-08-27 16:27:39,898 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 [2021-08-27 16:27:39,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:39,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:39,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:39,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:39,906 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 16:27:39,906 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 16:27:39,907 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:39,923 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 [2021-08-27 16:27:39,923 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:39,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:39,924 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) [2021-08-27 16:27:39,924 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 [2021-08-27 16:27:39,926 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 [2021-08-27 16:27:39,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:39,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:39,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:39,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:39,933 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 16:27:39,933 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 16:27:39,935 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:39,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2021-08-27 16:27:39,951 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:39,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:39,951 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) [2021-08-27 16:27:39,952 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 [2021-08-27 16:27:39,953 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 [2021-08-27 16:27:39,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:39,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:39,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:39,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:39,960 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 16:27:39,960 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 16:27:39,968 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:39,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2021-08-27 16:27:39,984 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:39,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:39,985 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) [2021-08-27 16:27:39,985 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 [2021-08-27 16:27:39,986 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 [2021-08-27 16:27:39,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:39,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:39,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:39,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:39,994 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 16:27:39,994 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 16:27:39,996 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:40,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2021-08-27 16:27:40,012 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:40,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:40,012 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) [2021-08-27 16:27:40,013 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 [2021-08-27 16:27:40,014 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 [2021-08-27 16:27:40,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:40,021 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:40,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:40,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:40,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:40,021 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:40,021 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:40,024 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:40,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2021-08-27 16:27:40,040 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:40,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:40,041 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) [2021-08-27 16:27:40,042 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 [2021-08-27 16:27:40,043 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 [2021-08-27 16:27:40,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:40,049 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:40,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:40,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:40,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:40,050 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:40,050 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:40,051 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:40,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2021-08-27 16:27:40,066 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:40,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:40,067 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) [2021-08-27 16:27:40,068 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 [2021-08-27 16:27:40,068 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 [2021-08-27 16:27:40,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:40,075 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:40,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:40,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:40,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:40,076 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:40,076 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:40,077 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:40,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2021-08-27 16:27:40,092 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:40,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:40,093 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) [2021-08-27 16:27:40,094 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 [2021-08-27 16:27:40,095 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 [2021-08-27 16:27:40,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:40,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:40,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:40,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:40,102 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 16:27:40,102 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 16:27:40,104 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:40,119 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 [2021-08-27 16:27:40,121 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:40,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:40,122 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) [2021-08-27 16:27:40,122 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 [2021-08-27 16:27:40,124 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 [2021-08-27 16:27:40,130 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:40,130 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:40,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:40,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:40,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:40,130 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:40,131 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:40,132 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:40,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2021-08-27 16:27:40,148 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:40,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:40,148 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) [2021-08-27 16:27:40,149 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 [2021-08-27 16:27:40,150 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 [2021-08-27 16:27:40,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:40,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:40,157 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-08-27 16:27:40,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:40,163 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2021-08-27 16:27:40,163 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2021-08-27 16:27:40,175 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 16:27:40,188 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2021-08-27 16:27:40,188 INFO L444 ModelExtractionUtils]: 6 out of 16 variables were initially zero. Simplification set additionally 7 variables to zero. [2021-08-27 16:27:40,188 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:40,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:40,189 INFO L229 MonitoredProcess]: Starting monitored process 125 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) [2021-08-27 16:27:40,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2021-08-27 16:27:40,191 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 16:27:40,201 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2021-08-27 16:27:40,201 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 16:27:40,202 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ackermann_~n) = 1*ackermann_~n Supporting invariants [1*ackermann_~n >= 0] [2021-08-27 16:27:40,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Ended with exit code 0 [2021-08-27 16:27:40,228 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2021-08-27 16:27:40,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:27:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:40,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 16:27:40,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:27:40,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Forceful destruction successful, exit code 0 [2021-08-27 16:27:40,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:40,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 16:27:40,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:27:40,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:27:40,442 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 4 loop predicates [2021-08-27 16:27:40,442 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) [2021-08-27 16:27:40,467 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. [2021-08-27 16:27:40,468 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 [2021-08-27 16:27:40,468 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) [2021-08-27 16:27:40,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2021-08-27 16:27:40,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 15 letters. Loop has 4 letters. [2021-08-27 16:27:40,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:27:40,469 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-08-27 16:27:40,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:27:40,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:40,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 16:27:40,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:27:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:40,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 16:27:40,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:27:40,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:27:40,680 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 4 loop predicates [2021-08-27 16:27:40,680 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) [2021-08-27 16:27:40,709 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. [2021-08-27 16:27:40,710 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 [2021-08-27 16:27:40,710 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) [2021-08-27 16:27:40,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2021-08-27 16:27:40,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 15 letters. Loop has 4 letters. [2021-08-27 16:27:40,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:27:40,712 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-08-27 16:27:40,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:27:40,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:40,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 16:27:40,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:27:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:40,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 16:27:40,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:27:40,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:27:40,928 INFO L152 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 [2021-08-27 16:27:40,928 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) [2021-08-27 16:27:41,034 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. [2021-08-27 16:27:41,037 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 [2021-08-27 16:27:41,037 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) [2021-08-27 16:27:41,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2021-08-27 16:27:41,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 15 letters. Loop has 4 letters. [2021-08-27 16:27:41,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:27:41,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 19 letters. Loop has 4 letters. [2021-08-27 16:27:41,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:27:41,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 15 letters. Loop has 8 letters. [2021-08-27 16:27:41,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:27:41,041 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 171 states and 230 transitions. [2021-08-27 16:27:41,047 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2021-08-27 16:27:41,052 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 171 states to 113 states and 162 transitions. [2021-08-27 16:27:41,052 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2021-08-27 16:27:41,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2021-08-27 16:27:41,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 162 transitions. [2021-08-27 16:27:41,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:27:41,054 INFO L681 BuchiCegarLoop]: Abstraction has 113 states and 162 transitions. [2021-08-27 16:27:41,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 162 transitions. [2021-08-27 16:27:41,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2021-08-27 16:27:41,074 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) [2021-08-27 16:27:41,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 150 transitions. [2021-08-27 16:27:41,078 INFO L704 BuchiCegarLoop]: Abstraction has 108 states and 150 transitions. [2021-08-27 16:27:41,078 INFO L587 BuchiCegarLoop]: Abstraction has 108 states and 150 transitions. [2021-08-27 16:27:41,078 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-27 16:27:41,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states and 150 transitions. [2021-08-27 16:27:41,080 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2021-08-27 16:27:41,081 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:27:41,081 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:27:41,082 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:27:41,083 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:27:41,083 INFO L791 eck$LassoCheckResult]: Stem: 1939#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1940#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet10;havoc main_#t~nondet10; 1949#L29 assume !(main_~m~0 < 0 || main_~m~0 > 3);main_~n~0 := main_#t~nondet11;havoc main_#t~nondet11; 1950#L35 assume !(main_~n~0 < 0 || main_~n~0 > 23); 1959#L41 call main_#t~ret12 := ackermann(main_~m~0, main_~n~0);< 1968#ackermannENTRY ~m := #in~m;~n := #in~n; 1958#L17 assume !(0 == ~m); 1960#L20 assume !(0 == ~n); 1942#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 1941#ackermannENTRY ~m := #in~m;~n := #in~n; 1943#L17 assume !(0 == ~m); 2025#L20 assume 0 == ~n; 1953#L21 call #t~ret7 := ackermann(~m - 1, 1);< 2006#ackermannENTRY ~m := #in~m;~n := #in~n; 2020#L17 assume 0 == ~m;#res := 1 + ~n; 2019#ackermannFINAL assume true; 1951#ackermannEXIT >#43#return; 1957#L21-1 #res := #t~ret7;havoc #t~ret7; 1947#ackermannFINAL assume true; 1948#ackermannEXIT >#45#return; 1975#L23-1 [2021-08-27 16:27:41,083 INFO L793 eck$LassoCheckResult]: Loop: 1975#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 1978#ackermannENTRY ~m := #in~m;~n := #in~n; 2012#L17 assume !(0 == ~m); 1980#L20 assume !(0 == ~n); 1974#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 1978#ackermannENTRY ~m := #in~m;~n := #in~n; 2012#L17 assume !(0 == ~m); 1980#L20 assume 0 == ~n; 1965#L21 call #t~ret7 := ackermann(~m - 1, 1);< 1970#ackermannENTRY ~m := #in~m;~n := #in~n; 2015#L17 assume 0 == ~m;#res := 1 + ~n; 2014#ackermannFINAL assume true; 2004#ackermannEXIT >#43#return; 2001#L21-1 #res := #t~ret7;havoc #t~ret7; 1999#ackermannFINAL assume true; 1985#ackermannEXIT >#45#return; 1975#L23-1 [2021-08-27 16:27:41,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:27:41,084 INFO L82 PathProgramCache]: Analyzing trace with hash -2142297082, now seen corresponding path program 1 times [2021-08-27 16:27:41,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:27:41,084 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386984891] [2021-08-27 16:27:41,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:27:41,085 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:27:41,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:27:41,105 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:27:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:27:41,128 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:27:41,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:27:41,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1250092377, now seen corresponding path program 1 times [2021-08-27 16:27:41,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:27:41,139 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588016444] [2021-08-27 16:27:41,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:27:41,139 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:27:41,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:27:41,144 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:27:41,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:27:41,161 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:27:41,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:27:41,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1017421986, now seen corresponding path program 1 times [2021-08-27 16:27:41,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:27:41,162 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259477241] [2021-08-27 16:27:41,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:27:41,162 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:27:41,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:41,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-08-27 16:27:41,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:41,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:27:41,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:41,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-08-27 16:27:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:41,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:27:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:41,320 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 22 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-08-27 16:27:41,320 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:27:41,320 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259477241] [2021-08-27 16:27:41,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259477241] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 16:27:41,321 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474079534] [2021-08-27 16:27:41,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:27:41,321 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 16:27:41,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:41,322 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 16:27:41,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Waiting until timeout for monitored process [2021-08-27 16:27:41,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:41,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-27 16:27:41,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:27:41,630 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 17 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-08-27 16:27:41,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474079534] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 16:27:41,631 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 16:27:41,631 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 13 [2021-08-27 16:27:41,631 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809720287] [2021-08-27 16:27:41,908 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 16:27:41,908 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 16:27:41,908 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 16:27:41,908 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 16:27:41,908 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-27 16:27:41,908 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:41,908 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 16:27:41,908 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 16:27:41,908 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann02.c_Iteration7_Loop [2021-08-27 16:27:41,908 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 16:27:41,908 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 16:27:41,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:41,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:41,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:41,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:41,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:41,968 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 16:27:41,969 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-27 16:27:41,969 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:41,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:41,970 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) [2021-08-27 16:27:41,970 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 [2021-08-27 16:27:41,972 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:41,972 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:41,981 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:27:41,981 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret9=0} Honda state: {ackermann_#t~ret9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:27:41,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Ended with exit code 0 [2021-08-27 16:27:41,996 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:41,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:41,997 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) [2021-08-27 16:27:42,000 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 [2021-08-27 16:27:42,001 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:42,002 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:42,024 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 [2021-08-27 16:27:42,024 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:42,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:42,025 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) [2021-08-27 16:27:42,027 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 [2021-08-27 16:27:42,028 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-27 16:27:42,028 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:43,531 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-27 16:27:43,535 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 [2021-08-27 16:27:43,536 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 16:27:43,536 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 16:27:43,536 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 16:27:43,536 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 16:27:43,536 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 16:27:43,536 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:43,536 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 16:27:43,536 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 16:27:43,536 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann02.c_Iteration7_Loop [2021-08-27 16:27:43,536 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 16:27:43,536 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 16:27:43,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:43,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:43,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:43,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:43,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:43,632 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 16:27:43,633 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 16:27:43,633 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:43,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:43,634 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) [2021-08-27 16:27:43,634 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 [2021-08-27 16:27:43,635 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 [2021-08-27 16:27:43,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:43,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:43,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:43,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:43,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:43,643 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:43,643 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:43,644 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:43,662 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 [2021-08-27 16:27:43,662 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:43,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:43,663 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) [2021-08-27 16:27:43,663 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 [2021-08-27 16:27:43,664 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 [2021-08-27 16:27:43,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:43,671 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:43,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:43,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:43,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:43,671 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:43,671 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:43,672 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:43,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Forceful destruction successful, exit code 0 [2021-08-27 16:27:43,691 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:43,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:43,692 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) [2021-08-27 16:27:43,692 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 [2021-08-27 16:27:43,694 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 [2021-08-27 16:27:43,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:43,700 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:43,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:43,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:43,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:43,701 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:43,701 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:43,702 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 16:27:43,704 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2021-08-27 16:27:43,704 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-08-27 16:27:43,704 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:43,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:43,705 INFO L229 MonitoredProcess]: Starting monitored process 133 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) [2021-08-27 16:27:43,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2021-08-27 16:27:43,706 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 16:27:43,706 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-08-27 16:27:43,706 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 16:27:43,706 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ackermann_~m) = 1*ackermann_~m Supporting invariants [] [2021-08-27 16:27:43,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Ended with exit code 0 [2021-08-27 16:27:43,723 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-08-27 16:27:43,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:27:43,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:43,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 16:27:43,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:27:43,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Forceful destruction successful, exit code 0 [2021-08-27 16:27:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:44,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-27 16:27:44,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:27:44,209 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-27 16:27:44,210 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2021-08-27 16:27:44,211 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) [2021-08-27 16:27:44,316 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. [2021-08-27 16:27:44,318 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 [2021-08-27 16:27:44,318 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) [2021-08-27 16:27:44,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2021-08-27 16:27:44,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 25 transitions. Stem has 20 letters. Loop has 16 letters. [2021-08-27 16:27:44,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:27:44,319 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-08-27 16:27:44,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:27:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:44,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 16:27:44,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:27:44,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:44,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-27 16:27:44,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:27:44,757 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-27 16:27:44,758 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates [2021-08-27 16:27:44,758 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) [2021-08-27 16:27:44,965 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. [2021-08-27 16:27:44,966 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 [2021-08-27 16:27:44,966 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) [2021-08-27 16:27:44,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2021-08-27 16:27:44,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 20 letters. Loop has 16 letters. [2021-08-27 16:27:44,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:27:44,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 36 letters. Loop has 16 letters. [2021-08-27 16:27:44,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:27:44,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 20 letters. Loop has 32 letters. [2021-08-27 16:27:44,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:27:44,968 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 272 states and 409 transitions. [2021-08-27 16:27:44,972 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 47 [2021-08-27 16:27:44,975 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 272 states to 222 states and 347 transitions. [2021-08-27 16:27:44,976 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2021-08-27 16:27:44,976 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2021-08-27 16:27:44,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 222 states and 347 transitions. [2021-08-27 16:27:44,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:27:44,976 INFO L681 BuchiCegarLoop]: Abstraction has 222 states and 347 transitions. [2021-08-27 16:27:44,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states and 347 transitions. [2021-08-27 16:27:44,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 209. [2021-08-27 16:27:44,987 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) [2021-08-27 16:27:44,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 327 transitions. [2021-08-27 16:27:44,989 INFO L704 BuchiCegarLoop]: Abstraction has 209 states and 327 transitions. [2021-08-27 16:27:44,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:27:44,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 16:27:44,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-08-27 16:27:44,990 INFO L87 Difference]: Start difference. First operand 209 states and 327 transitions. Second operand has 14 states, 12 states have (on average 2.5) internal successors, (30), 10 states have internal predecessors, (30), 5 states have call successors, (7), 2 states have call predecessors, (7), 6 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2021-08-27 16:27:45,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:27:45,208 INFO L93 Difference]: Finished difference Result 232 states and 364 transitions. [2021-08-27 16:27:45,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 16:27:45,209 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 232 states and 364 transitions. [2021-08-27 16:27:45,212 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 53 [2021-08-27 16:27:45,216 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 232 states to 230 states and 362 transitions. [2021-08-27 16:27:45,216 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2021-08-27 16:27:45,216 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2021-08-27 16:27:45,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 230 states and 362 transitions. [2021-08-27 16:27:45,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:27:45,217 INFO L681 BuchiCegarLoop]: Abstraction has 230 states and 362 transitions. [2021-08-27 16:27:45,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states and 362 transitions. [2021-08-27 16:27:45,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 223. [2021-08-27 16:27:45,226 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) [2021-08-27 16:27:45,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 351 transitions. [2021-08-27 16:27:45,228 INFO L704 BuchiCegarLoop]: Abstraction has 223 states and 351 transitions. [2021-08-27 16:27:45,229 INFO L587 BuchiCegarLoop]: Abstraction has 223 states and 351 transitions. [2021-08-27 16:27:45,229 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-27 16:27:45,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 223 states and 351 transitions. [2021-08-27 16:27:45,230 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 53 [2021-08-27 16:27:45,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:27:45,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:27:45,231 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:27:45,231 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 16:27:45,232 INFO L791 eck$LassoCheckResult]: Stem: 3422#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 3423#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet10;havoc main_#t~nondet10; 3443#L29 assume !(main_~m~0 < 0 || main_~m~0 > 3);main_~n~0 := main_#t~nondet11;havoc main_#t~nondet11; 3444#L35 assume !(main_~n~0 < 0 || main_~n~0 > 23); 3476#L41 call main_#t~ret12 := ackermann(main_~m~0, main_~n~0);< 3477#ackermannENTRY ~m := #in~m;~n := #in~n; 3524#L17 assume !(0 == ~m); 3522#L20 assume !(0 == ~n); 3451#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 3518#ackermannENTRY ~m := #in~m;~n := #in~n; 3519#L17 assume !(0 == ~m); 3535#L20 assume 0 == ~n; 3431#L21 call #t~ret7 := ackermann(~m - 1, 1);< 3533#ackermannENTRY ~m := #in~m;~n := #in~n; 3536#L17 assume 0 == ~m;#res := 1 + ~n; 3534#ackermannFINAL assume true; 3530#ackermannEXIT >#43#return; 3529#L21-1 #res := #t~ret7;havoc #t~ret7; 3528#ackermannFINAL assume true; 3526#ackermannEXIT >#45#return; 3469#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 3475#ackermannENTRY ~m := #in~m;~n := #in~n; 3608#L17 assume !(0 == ~m); 3462#L20 assume !(0 == ~n); 3464#L23 [2021-08-27 16:27:45,232 INFO L793 eck$LassoCheckResult]: Loop: 3464#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 3581#ackermannENTRY ~m := #in~m;~n := #in~n; 3578#L17 assume !(0 == ~m); 3579#L20 assume !(0 == ~n); 3464#L23 [2021-08-27 16:27:45,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:27:45,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1132004457, now seen corresponding path program 2 times [2021-08-27 16:27:45,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:27:45,232 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304397285] [2021-08-27 16:27:45,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:27:45,233 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:27:45,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:45,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-08-27 16:27:45,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:45,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:27:45,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:45,322 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-27 16:27:45,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:27:45,322 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304397285] [2021-08-27 16:27:45,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304397285] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 16:27:45,323 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728453494] [2021-08-27 16:27:45,323 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 16:27:45,323 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 16:27:45,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:45,325 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) [2021-08-27 16:27:45,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (134)] Waiting until timeout for monitored process [2021-08-27 16:27:45,554 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 16:27:45,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 16:27:45,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-27 16:27:45,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:27:45,664 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-27 16:27:45,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728453494] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 16:27:45,664 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 16:27:45,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2021-08-27 16:27:45,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462598036] [2021-08-27 16:27:45,665 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:27:45,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:27:45,665 INFO L82 PathProgramCache]: Analyzing trace with hash 2259284, now seen corresponding path program 4 times [2021-08-27 16:27:45,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:27:45,665 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566717922] [2021-08-27 16:27:45,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:27:45,666 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:27:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:27:45,674 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:27:45,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:27:45,677 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:27:45,757 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 16:27:45,757 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 16:27:45,757 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 16:27:45,757 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 16:27:45,757 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-27 16:27:45,757 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:45,757 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 16:27:45,757 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 16:27:45,757 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann02.c_Iteration8_Loop [2021-08-27 16:27:45,757 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 16:27:45,757 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 16:27:45,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:45,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:45,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:45,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:45,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:45,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:45,833 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 16:27:45,833 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-27 16:27:45,834 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:45,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:45,834 INFO L229 MonitoredProcess]: Starting monitored process 135 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) [2021-08-27 16:27:45,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2021-08-27 16:27:45,836 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:45,836 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:45,845 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:27:45,845 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:27:45,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Ended with exit code 0 [2021-08-27 16:27:45,860 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:45,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:45,861 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) [2021-08-27 16:27:45,861 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 [2021-08-27 16:27:45,862 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:45,863 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:45,869 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:27:45,870 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret8=0} Honda state: {ackermann_#t~ret8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:27:45,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Ended with exit code 0 [2021-08-27 16:27:45,885 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:45,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:45,886 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) [2021-08-27 16:27:45,886 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 [2021-08-27 16:27:45,888 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:45,888 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:45,900 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:27:45,901 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~m=7, ackermann_~m=7} Honda state: {ackermann_#in~m=7, ackermann_~m=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:27:45,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Ended with exit code 0 [2021-08-27 16:27:45,916 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:45,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:45,917 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) [2021-08-27 16:27:45,922 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 [2021-08-27 16:27:45,923 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:45,923 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:45,933 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:27:45,933 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret7=0} Honda state: {ackermann_#t~ret7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:27:45,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Ended with exit code 0 [2021-08-27 16:27:45,948 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:45,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:45,949 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) [2021-08-27 16:27:45,949 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 [2021-08-27 16:27:45,951 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:45,951 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:45,958 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:27:45,958 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret9=0} Honda state: {ackermann_#t~ret9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:27:45,974 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 [2021-08-27 16:27:45,974 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:45,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:45,974 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) [2021-08-27 16:27:45,975 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 [2021-08-27 16:27:45,976 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:45,976 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:46,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Forceful destruction successful, exit code 0 [2021-08-27 16:27:46,005 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:46,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:46,005 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) [2021-08-27 16:27:46,006 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 [2021-08-27 16:27:46,007 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-27 16:27:46,007 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:48,556 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:27:48,556 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=-1, ackermann_#in~n=1} Honda state: {ackermann_~n=-1, ackermann_#in~n=1} Generalized eigenvectors: [{ackermann_~n=-1, ackermann_#in~n=7}, {ackermann_~n=0, ackermann_#in~n=-8}, {ackermann_~n=0, ackermann_#in~n=-2}] Lambdas: [1, 0, 0] Nus: [1, 0] [2021-08-27 16:27:48,573 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 [2021-08-27 16:27:48,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:27:48,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 16:27:48,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 16:27:48,573 INFO L87 Difference]: Start difference. First operand 223 states and 351 transitions. cyclomatic complexity: 135 Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 16:27:48,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:27:48,670 INFO L93 Difference]: Finished difference Result 169 states and 264 transitions. [2021-08-27 16:27:48,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 16:27:48,671 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 264 transitions. [2021-08-27 16:27:48,673 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2021-08-27 16:27:48,676 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 161 states and 238 transitions. [2021-08-27 16:27:48,677 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 113 [2021-08-27 16:27:48,677 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2021-08-27 16:27:48,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 161 states and 238 transitions. [2021-08-27 16:27:48,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:27:48,678 INFO L681 BuchiCegarLoop]: Abstraction has 161 states and 238 transitions. [2021-08-27 16:27:48,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states and 238 transitions. [2021-08-27 16:27:48,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 155. [2021-08-27 16:27:48,685 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) [2021-08-27 16:27:48,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 215 transitions. [2021-08-27 16:27:48,687 INFO L704 BuchiCegarLoop]: Abstraction has 155 states and 215 transitions. [2021-08-27 16:27:48,687 INFO L587 BuchiCegarLoop]: Abstraction has 155 states and 215 transitions. [2021-08-27 16:27:48,687 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-27 16:27:48,687 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 155 states and 215 transitions. [2021-08-27 16:27:48,688 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2021-08-27 16:27:48,688 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:27:48,688 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:27:48,700 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2021-08-27 16:27:48,701 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [12, 11, 7, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2] [2021-08-27 16:27:48,701 INFO L791 eck$LassoCheckResult]: Stem: 3913#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 3914#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet10;havoc main_#t~nondet10; 3929#L29 assume !(main_~m~0 < 0 || main_~m~0 > 3);main_~n~0 := main_#t~nondet11;havoc main_#t~nondet11; 3930#L35 assume !(main_~n~0 < 0 || main_~n~0 > 23); 3936#L41 call main_#t~ret12 := ackermann(main_~m~0, main_~n~0);< 3937#ackermannENTRY ~m := #in~m;~n := #in~n; 4032#L17 assume !(0 == ~m); 3935#L20 assume !(0 == ~n); 3919#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 4015#ackermannENTRY ~m := #in~m;~n := #in~n; 4009#L17 assume !(0 == ~m); 4008#L20 assume 0 == ~n; 3922#L21 call #t~ret7 := ackermann(~m - 1, 1);< 3983#ackermannENTRY ~m := #in~m;~n := #in~n; 4001#L17 assume !(0 == ~m); 4000#L20 assume !(0 == ~n); 3972#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 3999#ackermannENTRY ~m := #in~m;~n := #in~n; 4026#L17 assume !(0 == ~m); 4025#L20 assume !(0 == ~n); 3965#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 4018#ackermannENTRY ~m := #in~m;~n := #in~n; 4019#L17 assume !(0 == ~m); 4016#L20 assume 0 == ~n; 3925#L21 call #t~ret7 := ackermann(~m - 1, 1);< 3984#ackermannENTRY ~m := #in~m;~n := #in~n; 4014#L17 assume 0 == ~m;#res := 1 + ~n; 4007#ackermannFINAL assume true; 4004#ackermannEXIT >#43#return; 4005#L21-1 #res := #t~ret7;havoc #t~ret7; 4053#ackermannFINAL assume true; 4052#ackermannEXIT >#45#return; 4049#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 4051#ackermannENTRY ~m := #in~m;~n := #in~n; 4055#L17 assume 0 == ~m;#res := 1 + ~n; 4054#ackermannFINAL assume true; 4047#ackermannEXIT >#47#return; 4050#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 4064#ackermannFINAL assume true; 4062#ackermannEXIT >#45#return; 4061#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 4066#ackermannENTRY ~m := #in~m;~n := #in~n; 4067#L17 assume 0 == ~m;#res := 1 + ~n; 3993#ackermannFINAL assume true; 4065#ackermannEXIT >#47#return; 3932#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 3921#ackermannFINAL assume true; 3928#ackermannEXIT >#43#return; 3981#L21-1 #res := #t~ret7;havoc #t~ret7; 4020#ackermannFINAL assume true; 3968#ackermannEXIT >#45#return; 3938#L23-1 [2021-08-27 16:27:48,703 INFO L793 eck$LassoCheckResult]: Loop: 3938#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 3950#ackermannENTRY ~m := #in~m;~n := #in~n; 3956#L17 assume !(0 == ~m); 3958#L20 assume !(0 == ~n); 3942#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 3950#ackermannENTRY ~m := #in~m;~n := #in~n; 3956#L17 assume !(0 == ~m); 3958#L20 assume 0 == ~n; 3927#L21 call #t~ret7 := ackermann(~m - 1, 1);< 3944#ackermannENTRY ~m := #in~m;~n := #in~n; 3979#L17 assume !(0 == ~m); 3977#L20 assume !(0 == ~n); 3948#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 3967#ackermannENTRY ~m := #in~m;~n := #in~n; 3989#L17 assume !(0 == ~m); 3988#L20 assume !(0 == ~n); 3941#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 3962#ackermannENTRY ~m := #in~m;~n := #in~n; 3959#L17 assume !(0 == ~m); 3960#L20 assume !(0 == ~n); 3943#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 3962#ackermannENTRY ~m := #in~m;~n := #in~n; 3959#L17 assume !(0 == ~m); 3960#L20 assume !(0 == ~n); 3943#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 3962#ackermannENTRY ~m := #in~m;~n := #in~n; 3959#L17 assume !(0 == ~m); 3961#L20 assume 0 == ~n; 3927#L21 call #t~ret7 := ackermann(~m - 1, 1);< 3944#ackermannENTRY ~m := #in~m;~n := #in~n; 3979#L17 assume 0 == ~m;#res := 1 + ~n; 3980#ackermannFINAL assume true; 4043#ackermannEXIT >#43#return; 4033#L21-1 #res := #t~ret7;havoc #t~ret7; 4034#ackermannFINAL assume true; 3985#ackermannEXIT >#45#return; 3986#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 4042#ackermannENTRY ~m := #in~m;~n := #in~n; 4057#L17 assume 0 == ~m;#res := 1 + ~n; 4056#ackermannFINAL assume true; 4040#ackermannEXIT >#47#return; 4035#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 4021#ackermannFINAL assume true; 4022#ackermannEXIT >#45#return; 4037#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 4041#ackermannENTRY ~m := #in~m;~n := #in~n; 4058#L17 assume 0 == ~m;#res := 1 + ~n; 3957#ackermannFINAL assume true; 4036#ackermannEXIT >#47#return; 4035#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 4021#ackermannFINAL assume true; 4022#ackermannEXIT >#45#return; 4038#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 4041#ackermannENTRY ~m := #in~m;~n := #in~n; 4058#L17 assume 0 == ~m;#res := 1 + ~n; 3957#ackermannFINAL assume true; 4036#ackermannEXIT >#47#return; 4039#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 4063#ackermannFINAL assume true; 4060#ackermannEXIT >#45#return; 4061#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 4066#ackermannENTRY ~m := #in~m;~n := #in~n; 4067#L17 assume 0 == ~m;#res := 1 + ~n; 3993#ackermannFINAL assume true; 4065#ackermannEXIT >#47#return; 3932#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 3921#ackermannFINAL assume true; 3928#ackermannEXIT >#43#return; 3981#L21-1 #res := #t~ret7;havoc #t~ret7; 4020#ackermannFINAL assume true; 3968#ackermannEXIT >#45#return; 3938#L23-1 [2021-08-27 16:27:48,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:27:48,703 INFO L82 PathProgramCache]: Analyzing trace with hash -77167706, now seen corresponding path program 1 times [2021-08-27 16:27:48,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:27:48,704 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633420860] [2021-08-27 16:27:48,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:27:48,704 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:27:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:48,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-08-27 16:27:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:48,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:27:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:48,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:27:48,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:48,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:27:48,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:48,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:27:48,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:48,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:27:48,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:48,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 16:27:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:48,854 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 45 proven. 23 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-08-27 16:27:48,855 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:27:48,855 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633420860] [2021-08-27 16:27:48,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633420860] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 16:27:48,855 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111859451] [2021-08-27 16:27:48,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:27:48,855 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 16:27:48,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:48,856 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 16:27:48,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (142)] Waiting until timeout for monitored process [2021-08-27 16:27:49,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:49,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 16:27:49,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:27:49,240 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 48 proven. 15 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-08-27 16:27:49,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111859451] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 16:27:49,241 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 16:27:49,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2021-08-27 16:27:49,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339985956] [2021-08-27 16:27:49,241 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:27:49,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:27:49,242 INFO L82 PathProgramCache]: Analyzing trace with hash -804805273, now seen corresponding path program 1 times [2021-08-27 16:27:49,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:27:49,242 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255247030] [2021-08-27 16:27:49,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:27:49,242 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:27:49,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:49,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 16:27:49,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:49,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:27:49,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:49,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:27:49,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:49,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:27:49,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:49,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:27:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:49,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:27:49,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:49,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:27:49,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:49,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:27:49,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:49,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 16:27:49,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:49,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-08-27 16:27:49,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:49,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-08-27 16:27:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:49,424 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 103 proven. 65 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-08-27 16:27:49,424 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:27:49,424 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255247030] [2021-08-27 16:27:49,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255247030] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 16:27:49,425 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569015139] [2021-08-27 16:27:49,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:27:49,425 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 16:27:49,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:49,433 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 16:27:49,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (143)] Waiting until timeout for monitored process [2021-08-27 16:27:49,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:49,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-27 16:27:49,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:27:49,984 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 112 proven. 45 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2021-08-27 16:27:49,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569015139] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 16:27:49,984 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 16:27:49,984 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2021-08-27 16:27:49,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327128079] [2021-08-27 16:27:49,985 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:27:49,985 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:27:49,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 16:27:49,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-27 16:27:49,986 INFO L87 Difference]: Start difference. First operand 155 states and 215 transitions. cyclomatic complexity: 64 Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 9 states have call successors, (11), 1 states have call predecessors, (11), 7 states have return successors, (12), 6 states have call predecessors, (12), 9 states have call successors, (12) [2021-08-27 16:27:50,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:27:50,099 INFO L93 Difference]: Finished difference Result 177 states and 292 transitions. [2021-08-27 16:27:50,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 16:27:50,100 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 177 states and 292 transitions. [2021-08-27 16:27:50,102 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2021-08-27 16:27:50,105 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 177 states to 156 states and 245 transitions. [2021-08-27 16:27:50,105 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 109 [2021-08-27 16:27:50,105 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 109 [2021-08-27 16:27:50,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 156 states and 245 transitions. [2021-08-27 16:27:50,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:27:50,106 INFO L681 BuchiCegarLoop]: Abstraction has 156 states and 245 transitions. [2021-08-27 16:27:50,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states and 245 transitions. [2021-08-27 16:27:50,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 137. [2021-08-27 16:27:50,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 93 states have (on average 1.10752688172043) internal successors, (103), 94 states have internal predecessors, (103), 28 states have call successors, (33), 21 states have call predecessors, (33), 16 states have return successors, (48), 21 states have call predecessors, (48), 25 states have call successors, (48) [2021-08-27 16:27:50,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 184 transitions. [2021-08-27 16:27:50,112 INFO L704 BuchiCegarLoop]: Abstraction has 137 states and 184 transitions. [2021-08-27 16:27:50,112 INFO L587 BuchiCegarLoop]: Abstraction has 137 states and 184 transitions. [2021-08-27 16:27:50,112 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-08-27 16:27:50,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 184 transitions. [2021-08-27 16:27:50,113 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2021-08-27 16:27:50,114 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:27:50,114 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:27:50,118 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:27:50,119 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [13, 12, 9, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3] [2021-08-27 16:27:50,119 INFO L791 eck$LassoCheckResult]: Stem: 5023#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 5024#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet10;havoc main_#t~nondet10; 5046#L29 assume !(main_~m~0 < 0 || main_~m~0 > 3);main_~n~0 := main_#t~nondet11;havoc main_#t~nondet11; 5047#L35 assume !(main_~n~0 < 0 || main_~n~0 > 23); 5045#L41 call main_#t~ret12 := ackermann(main_~m~0, main_~n~0);< 5063#ackermannENTRY ~m := #in~m;~n := #in~n; 5093#L17 assume !(0 == ~m); 5091#L20 assume !(0 == ~n); 5040#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 5088#ackermannENTRY ~m := #in~m;~n := #in~n; 5087#L17 assume !(0 == ~m); 5055#L20 assume 0 == ~n; 5056#L21 call #t~ret7 := ackermann(~m - 1, 1);< 5100#ackermannENTRY ~m := #in~m;~n := #in~n; 5105#L17 assume !(0 == ~m); 5106#L20 assume !(0 == ~n); 5058#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 5071#ackermannENTRY ~m := #in~m;~n := #in~n; 5103#L17 assume !(0 == ~m); 5097#L20 assume 0 == ~n; 5070#L21 call #t~ret7 := ackermann(~m - 1, 1);< 5101#ackermannENTRY ~m := #in~m;~n := #in~n; 5123#L17 assume 0 == ~m;#res := 1 + ~n; 5121#ackermannFINAL assume true; 5115#ackermannEXIT >#43#return; 5116#L21-1 #res := #t~ret7;havoc #t~ret7; 5147#ackermannFINAL assume true; 5144#ackermannEXIT >#45#return; 5126#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 5127#ackermannENTRY ~m := #in~m;~n := #in~n; 5139#L17 assume 0 == ~m;#res := 1 + ~n; 5138#ackermannFINAL assume true; 5125#ackermannEXIT >#47#return; 5124#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 5122#ackermannFINAL assume true; 5113#ackermannEXIT >#43#return; 5066#L21-1 #res := #t~ret7;havoc #t~ret7; 5032#ackermannFINAL assume true; 5044#ackermannEXIT >#45#return; 5035#L23-1 [2021-08-27 16:27:50,119 INFO L793 eck$LassoCheckResult]: Loop: 5035#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 5069#ackermannENTRY ~m := #in~m;~n := #in~n; 5075#L17 assume !(0 == ~m); 5077#L20 assume !(0 == ~n); 5034#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 5069#ackermannENTRY ~m := #in~m;~n := #in~n; 5075#L17 assume !(0 == ~m); 5077#L20 assume 0 == ~n; 5064#L21 call #t~ret7 := ackermann(~m - 1, 1);< 5065#ackermannENTRY ~m := #in~m;~n := #in~n; 5085#L17 assume !(0 == ~m); 5084#L20 assume !(0 == ~n); 5067#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 5081#ackermannENTRY ~m := #in~m;~n := #in~n; 5082#L17 assume !(0 == ~m); 5074#L20 assume 0 == ~n; 5073#L21 call #t~ret7 := ackermann(~m - 1, 1);< 5065#ackermannENTRY ~m := #in~m;~n := #in~n; 5085#L17 assume !(0 == ~m); 5084#L20 assume !(0 == ~n); 5067#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 5081#ackermannENTRY ~m := #in~m;~n := #in~n; 5082#L17 assume !(0 == ~m); 5074#L20 assume 0 == ~n; 5073#L21 call #t~ret7 := ackermann(~m - 1, 1);< 5065#ackermannENTRY ~m := #in~m;~n := #in~n; 5085#L17 assume 0 == ~m;#res := 1 + ~n; 5086#ackermannFINAL assume true; 5117#ackermannEXIT >#43#return; 5119#L21-1 #res := #t~ret7;havoc #t~ret7; 5137#ackermannFINAL assume true; 5136#ackermannEXIT >#45#return; 5132#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 5133#ackermannENTRY ~m := #in~m;~n := #in~n; 5146#L17 assume 0 == ~m;#res := 1 + ~n; 5145#ackermannFINAL assume true; 5131#ackermannEXIT >#47#return; 5129#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 5128#ackermannFINAL assume true; 5120#ackermannEXIT >#43#return; 5114#L21-1 #res := #t~ret7;havoc #t~ret7; 5143#ackermannFINAL assume true; 5135#ackermannEXIT >#45#return; 5061#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 5134#ackermannENTRY ~m := #in~m;~n := #in~n; 5140#L17 assume !(0 == ~m); 5072#L20 assume 0 == ~n; 5073#L21 call #t~ret7 := ackermann(~m - 1, 1);< 5065#ackermannENTRY ~m := #in~m;~n := #in~n; 5085#L17 assume !(0 == ~m); 5084#L20 assume !(0 == ~n); 5067#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 5081#ackermannENTRY ~m := #in~m;~n := #in~n; 5082#L17 assume !(0 == ~m); 5074#L20 assume 0 == ~n; 5073#L21 call #t~ret7 := ackermann(~m - 1, 1);< 5065#ackermannENTRY ~m := #in~m;~n := #in~n; 5085#L17 assume 0 == ~m;#res := 1 + ~n; 5086#ackermannFINAL assume true; 5117#ackermannEXIT >#43#return; 5119#L21-1 #res := #t~ret7;havoc #t~ret7; 5137#ackermannFINAL assume true; 5136#ackermannEXIT >#45#return; 5132#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 5133#ackermannENTRY ~m := #in~m;~n := #in~n; 5146#L17 assume 0 == ~m;#res := 1 + ~n; 5145#ackermannFINAL assume true; 5131#ackermannEXIT >#47#return; 5129#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 5128#ackermannFINAL assume true; 5120#ackermannEXIT >#43#return; 5114#L21-1 #res := #t~ret7;havoc #t~ret7; 5143#ackermannFINAL assume true; 5135#ackermannEXIT >#47#return; 5129#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 5128#ackermannFINAL assume true; 5120#ackermannEXIT >#43#return; 5066#L21-1 #res := #t~ret7;havoc #t~ret7; 5032#ackermannFINAL assume true; 5044#ackermannEXIT >#45#return; 5035#L23-1 [2021-08-27 16:27:50,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:27:50,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1100790060, now seen corresponding path program 2 times [2021-08-27 16:27:50,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:27:50,120 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174964720] [2021-08-27 16:27:50,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:27:50,120 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:27:50,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:27:50,130 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:27:50,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:27:50,157 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:27:50,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:27:50,158 INFO L82 PathProgramCache]: Analyzing trace with hash -119431079, now seen corresponding path program 2 times [2021-08-27 16:27:50,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:27:50,158 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801194456] [2021-08-27 16:27:50,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:27:50,159 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:27:50,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:50,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 16:27:50,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:50,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:27:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:50,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:27:50,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:50,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:27:50,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:50,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:27:50,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:50,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:27:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:50,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:27:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:50,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 16:27:50,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:50,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:27:50,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:50,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:27:50,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:50,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:27:50,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:50,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:27:50,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:50,331 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 152 proven. 59 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-08-27 16:27:50,332 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:27:50,332 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801194456] [2021-08-27 16:27:50,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801194456] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 16:27:50,332 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398604056] [2021-08-27 16:27:50,332 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 16:27:50,332 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 16:27:50,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:50,336 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 16:27:50,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (144)] Waiting until timeout for monitored process [2021-08-27 16:27:50,683 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 16:27:50,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 16:27:50,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 17 conjunts are in the unsatisfiable core [2021-08-27 16:27:50,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:27:51,002 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 90 proven. 84 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2021-08-27 16:27:51,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398604056] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 16:27:51,003 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 16:27:51,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2021-08-27 16:27:51,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138859867] [2021-08-27 16:27:51,003 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:27:51,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:27:51,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-08-27 16:27:51,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2021-08-27 16:27:51,004 INFO L87 Difference]: Start difference. First operand 137 states and 184 transitions. cyclomatic complexity: 51 Second operand has 20 states, 16 states have (on average 2.375) internal successors, (38), 13 states have internal predecessors, (38), 7 states have call successors, (11), 1 states have call predecessors, (11), 11 states have return successors, (21), 15 states have call predecessors, (21), 7 states have call successors, (21) [2021-08-27 16:27:51,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:27:51,814 INFO L93 Difference]: Finished difference Result 177 states and 270 transitions. [2021-08-27 16:27:51,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-08-27 16:27:51,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 177 states and 270 transitions. [2021-08-27 16:27:51,817 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 34 [2021-08-27 16:27:51,819 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 177 states to 176 states and 262 transitions. [2021-08-27 16:27:51,819 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2021-08-27 16:27:51,819 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 130 [2021-08-27 16:27:51,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 176 states and 262 transitions. [2021-08-27 16:27:51,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:27:51,820 INFO L681 BuchiCegarLoop]: Abstraction has 176 states and 262 transitions. [2021-08-27 16:27:51,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states and 262 transitions. [2021-08-27 16:27:51,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 165. [2021-08-27 16:27:51,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 109 states have (on average 1.0825688073394495) internal successors, (118), 113 states have internal predecessors, (118), 35 states have call successors, (40), 23 states have call predecessors, (40), 21 states have return successors, (88), 28 states have call predecessors, (88), 30 states have call successors, (88) [2021-08-27 16:27:51,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 246 transitions. [2021-08-27 16:27:51,826 INFO L704 BuchiCegarLoop]: Abstraction has 165 states and 246 transitions. [2021-08-27 16:27:51,826 INFO L587 BuchiCegarLoop]: Abstraction has 165 states and 246 transitions. [2021-08-27 16:27:51,826 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-08-27 16:27:51,827 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 165 states and 246 transitions. [2021-08-27 16:27:51,828 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 34 [2021-08-27 16:27:51,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:27:51,828 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:27:51,829 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:27:51,829 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-08-27 16:27:51,829 INFO L791 eck$LassoCheckResult]: Stem: 5936#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 5937#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet10;havoc main_#t~nondet10; 5956#L29 assume !(main_~m~0 < 0 || main_~m~0 > 3);main_~n~0 := main_#t~nondet11;havoc main_#t~nondet11; 5957#L35 assume !(main_~n~0 < 0 || main_~n~0 > 23); 5970#L41 call main_#t~ret12 := ackermann(main_~m~0, main_~n~0);< 5971#ackermannENTRY ~m := #in~m;~n := #in~n; 6001#L17 assume !(0 == ~m); 5999#L20 assume !(0 == ~n); 5986#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 5995#ackermannENTRY ~m := #in~m;~n := #in~n; 5996#L17 assume !(0 == ~m); 5985#L20 assume 0 == ~n; 5987#L21 call #t~ret7 := ackermann(~m - 1, 1);< 6037#ackermannENTRY ~m := #in~m;~n := #in~n; 6070#L17 assume !(0 == ~m); 6069#L20 assume !(0 == ~n); 5978#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 6039#ackermannENTRY ~m := #in~m;~n := #in~n; 6040#L17 assume !(0 == ~m); 5994#L20 assume 0 == ~n; 6008#L21 call #t~ret7 := ackermann(~m - 1, 1);< 6036#ackermannENTRY ~m := #in~m;~n := #in~n; 6077#L17 assume 0 == ~m;#res := 1 + ~n; 6076#ackermannFINAL assume true; 6075#ackermannEXIT >#43#return; 6073#L21-1 #res := #t~ret7;havoc #t~ret7; 6071#ackermannFINAL assume true; 6068#ackermannEXIT >#45#return; 6066#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 6067#ackermannENTRY ~m := #in~m;~n := #in~n; 6074#L17 assume 0 == ~m;#res := 1 + ~n; 6072#ackermannFINAL assume true; 6065#ackermannEXIT >#47#return; 6064#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 6063#ackermannFINAL assume true; 6056#ackermannEXIT >#43#return; 6053#L21-1 #res := #t~ret7;havoc #t~ret7; 6050#ackermannFINAL assume true; 6042#ackermannEXIT >#45#return; 5952#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 6022#ackermannENTRY [2021-08-27 16:27:51,829 INFO L793 eck$LassoCheckResult]: Loop: 6022#ackermannENTRY ~m := #in~m;~n := #in~n; 6021#L17 assume !(0 == ~m); 6020#L20 assume !(0 == ~n); 5950#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 6022#ackermannENTRY [2021-08-27 16:27:51,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:27:51,830 INFO L82 PathProgramCache]: Analyzing trace with hash -235246462, now seen corresponding path program 3 times [2021-08-27 16:27:51,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:27:51,830 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332846169] [2021-08-27 16:27:51,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:27:51,830 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:27:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:27:51,839 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:27:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:27:51,849 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:27:51,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:27:51,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1697294, now seen corresponding path program 5 times [2021-08-27 16:27:51,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:27:51,850 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206128200] [2021-08-27 16:27:51,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:27:51,851 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:27:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:27:51,854 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:27:51,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:27:51,855 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:27:51,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:27:51,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1578641935, now seen corresponding path program 4 times [2021-08-27 16:27:51,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:27:51,856 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762671074] [2021-08-27 16:27:51,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:27:51,856 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:27:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:27:51,864 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:27:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:27:51,875 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:27:51,930 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 16:27:51,930 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 16:27:51,930 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 16:27:51,931 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 16:27:51,931 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-27 16:27:51,931 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:51,931 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 16:27:51,931 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 16:27:51,931 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann02.c_Iteration11_Loop [2021-08-27 16:27:51,931 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 16:27:51,931 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 16:27:51,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:51,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:51,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:51,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:51,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:51,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:51,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:51,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:52,004 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 16:27:52,005 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-27 16:27:52,005 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:52,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:52,008 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) [2021-08-27 16:27:52,013 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:52,014 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:52,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 [2021-08-27 16:27:52,023 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:27:52,025 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret8=0} Honda state: {ackermann_#t~ret8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:27:52,049 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 [2021-08-27 16:27:52,049 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:52,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:52,050 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) [2021-08-27 16:27:52,050 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 [2021-08-27 16:27:52,052 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:52,052 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:52,059 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:27:52,059 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret7=0} Honda state: {ackermann_#t~ret7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:27:52,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Ended with exit code 0 [2021-08-27 16:27:52,075 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:52,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:52,076 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) [2021-08-27 16:27:52,098 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 [2021-08-27 16:27:52,098 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:52,098 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:52,128 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 [2021-08-27 16:27:52,128 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:52,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:52,129 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) [2021-08-27 16:27:52,130 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 [2021-08-27 16:27:52,131 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-27 16:27:52,131 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:52,182 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:27:52,182 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~n=-4} Honda state: {ackermann_#in~n=-4} Generalized eigenvectors: [{ackermann_#in~n=-1}, {ackermann_#in~n=0}, {ackermann_#in~n=0}] Lambdas: [1, 1, 1] Nus: [1, 0] [2021-08-27 16:27:52,199 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 [2021-08-27 16:27:52,199 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:52,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:52,200 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) [2021-08-27 16:27:52,200 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 [2021-08-27 16:27:52,202 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:52,202 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:52,213 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:27:52,213 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=0} Honda state: {ackermann_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:27:52,228 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 [2021-08-27 16:27:52,229 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:52,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:52,229 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) [2021-08-27 16:27:52,230 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 [2021-08-27 16:27:52,231 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:52,231 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:52,243 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:27:52,244 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~m=4} Honda state: {ackermann_#in~m=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:27:52,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Forceful destruction successful, exit code 0 [2021-08-27 16:27:52,260 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:52,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:52,261 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) [2021-08-27 16:27:52,261 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 [2021-08-27 16:27:52,263 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:52,264 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:52,277 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:27:52,277 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret9=0} Honda state: {ackermann_#t~ret9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:27:52,293 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 [2021-08-27 16:27:52,293 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:52,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:52,294 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) [2021-08-27 16:27:52,294 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 [2021-08-27 16:27:52,296 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:52,296 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:52,313 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:27:52,313 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~m=0} Honda state: {ackermann_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:27:52,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Forceful destruction successful, exit code 0 [2021-08-27 16:27:52,329 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:52,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:52,330 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) [2021-08-27 16:27:52,330 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 [2021-08-27 16:27:52,331 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:27:52,332 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:27:52,347 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 16:27:52,347 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 16:27:52,362 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 [2021-08-27 16:27:53,393 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 16:27:53,393 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 16:27:53,393 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 16:27:53,393 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 16:27:53,393 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 16:27:53,393 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:53,393 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 16:27:53,393 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 16:27:53,393 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ackermann02.c_Iteration11_Lasso [2021-08-27 16:27:53,393 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 16:27:53,393 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 16:27:53,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:53,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:53,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:53,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:53,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:53,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:53,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:53,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:53,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:53,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:53,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:53,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:53,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:53,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:53,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:53,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:53,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:53,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:53,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:53,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:53,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:53,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:53,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:53,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:53,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:53,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:53,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:53,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:53,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:53,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:53,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:27:53,720 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 16:27:53,720 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 16:27:53,720 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:53,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:53,721 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) [2021-08-27 16:27:53,721 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 [2021-08-27 16:27:53,723 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 [2021-08-27 16:27:53,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:53,729 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:53,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:53,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:53,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:53,730 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:53,730 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:53,730 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:53,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Ended with exit code 0 [2021-08-27 16:27:53,747 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:53,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:53,747 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) [2021-08-27 16:27:53,748 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 [2021-08-27 16:27:53,749 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 [2021-08-27 16:27:53,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:53,755 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:27:53,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:53,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:53,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:53,756 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:27:53,756 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:27:53,757 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:53,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Ended with exit code 0 [2021-08-27 16:27:53,773 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:53,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:53,773 INFO L229 MonitoredProcess]: Starting monitored process 156 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) [2021-08-27 16:27:53,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process [2021-08-27 16:27:53,775 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 [2021-08-27 16:27:53,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:53,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:53,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:27:53,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:53,783 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 16:27:53,783 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 16:27:53,785 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 16:27:53,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Ended with exit code 0 [2021-08-27 16:27:53,801 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:53,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:53,802 INFO L229 MonitoredProcess]: Starting monitored process 157 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) [2021-08-27 16:27:53,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2021-08-27 16:27:53,804 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 [2021-08-27 16:27:53,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:27:53,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:27:53,810 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-08-27 16:27:53,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:27:53,814 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2021-08-27 16:27:53,814 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2021-08-27 16:27:53,822 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 16:27:53,839 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2021-08-27 16:27:53,839 INFO L444 ModelExtractionUtils]: 0 out of 11 variables were initially zero. Simplification set additionally 8 variables to zero. [2021-08-27 16:27:53,839 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:27:53,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:53,840 INFO L229 MonitoredProcess]: Starting monitored process 158 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) [2021-08-27 16:27:53,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2021-08-27 16:27:53,842 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 16:27:53,849 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2021-08-27 16:27:53,850 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 16:27:53,850 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ackermann_#in~n) = 1*ackermann_#in~n Supporting invariants [1*ackermann_#in~n >= 0] [2021-08-27 16:27:53,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Ended with exit code 0 [2021-08-27 16:27:53,876 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2021-08-27 16:27:53,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:27:53,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:53,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 31 conjunts are in the unsatisfiable core [2021-08-27 16:27:53,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:27:54,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Forceful destruction successful, exit code 0 [2021-08-27 16:27:54,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:54,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 16:27:54,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:27:54,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:27:54,906 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.11 stem predicates 3 loop predicates [2021-08-27 16:27:54,906 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 165 states and 246 transitions. cyclomatic complexity: 86 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) [2021-08-27 16:27:55,212 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 165 states and 246 transitions. cyclomatic complexity: 86. 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 169 states and 255 transitions. Complement of second has 13 states. [2021-08-27 16:27:55,222 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 [2021-08-27 16:27:55,223 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) [2021-08-27 16:27:55,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 21 transitions. [2021-08-27 16:27:55,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 21 transitions. Stem has 40 letters. Loop has 4 letters. [2021-08-27 16:27:55,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:27:55,224 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-08-27 16:27:55,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:27:55,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:55,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 31 conjunts are in the unsatisfiable core [2021-08-27 16:27:55,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:27:56,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:56,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 16:27:56,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:27:56,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:27:56,174 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.11 stem predicates 3 loop predicates [2021-08-27 16:27:56,175 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 165 states and 246 transitions. cyclomatic complexity: 86 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) [2021-08-27 16:27:56,483 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 165 states and 246 transitions. cyclomatic complexity: 86. 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 169 states and 255 transitions. Complement of second has 13 states. [2021-08-27 16:27:56,484 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 [2021-08-27 16:27:56,484 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) [2021-08-27 16:27:56,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 21 transitions. [2021-08-27 16:27:56,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 21 transitions. Stem has 40 letters. Loop has 4 letters. [2021-08-27 16:27:56,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:27:56,485 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-08-27 16:27:56,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:27:56,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:56,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 31 conjunts are in the unsatisfiable core [2021-08-27 16:27:56,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:27:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:57,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 16:27:57,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:27:57,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:27:57,401 INFO L152 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 [2021-08-27 16:27:57,401 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 165 states and 246 transitions. cyclomatic complexity: 86 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) [2021-08-27 16:27:57,948 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 165 states and 246 transitions. cyclomatic complexity: 86. 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 258 states and 363 transitions. Complement of second has 42 states. [2021-08-27 16:27:57,957 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 [2021-08-27 16:27:57,957 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) [2021-08-27 16:27:57,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 37 transitions. [2021-08-27 16:27:57,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 37 transitions. Stem has 40 letters. Loop has 4 letters. [2021-08-27 16:27:57,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:27:57,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 37 transitions. Stem has 44 letters. Loop has 4 letters. [2021-08-27 16:27:57,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:27:57,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 37 transitions. Stem has 40 letters. Loop has 8 letters. [2021-08-27 16:27:57,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:27:57,959 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 258 states and 363 transitions. [2021-08-27 16:27:57,962 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2021-08-27 16:27:57,964 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 258 states to 209 states and 287 transitions. [2021-08-27 16:27:57,965 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 134 [2021-08-27 16:27:57,965 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 142 [2021-08-27 16:27:57,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 209 states and 287 transitions. [2021-08-27 16:27:57,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:27:57,966 INFO L681 BuchiCegarLoop]: Abstraction has 209 states and 287 transitions. [2021-08-27 16:27:57,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states and 287 transitions. [2021-08-27 16:27:57,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 184. [2021-08-27 16:27:57,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 122 states have (on average 1.0819672131147542) internal successors, (132), 124 states have internal predecessors, (132), 42 states have call successors, (48), 25 states have call predecessors, (48), 20 states have return successors, (60), 34 states have call predecessors, (60), 37 states have call successors, (60) [2021-08-27 16:27:57,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 240 transitions. [2021-08-27 16:27:57,972 INFO L704 BuchiCegarLoop]: Abstraction has 184 states and 240 transitions. [2021-08-27 16:27:57,972 INFO L587 BuchiCegarLoop]: Abstraction has 184 states and 240 transitions. [2021-08-27 16:27:57,972 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-08-27 16:27:57,973 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 184 states and 240 transitions. [2021-08-27 16:27:57,974 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2021-08-27 16:27:57,974 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:27:57,974 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:27:57,975 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [14, 11, 10, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2021-08-27 16:27:57,975 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [14, 11, 10, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3] [2021-08-27 16:27:57,975 INFO L791 eck$LassoCheckResult]: Stem: 7304#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 7305#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet10;havoc main_#t~nondet10; 7323#L29 assume !(main_~m~0 < 0 || main_~m~0 > 3);main_~n~0 := main_#t~nondet11;havoc main_#t~nondet11; 7324#L35 assume !(main_~n~0 < 0 || main_~n~0 > 23); 7341#L41 call main_#t~ret12 := ackermann(main_~m~0, main_~n~0);< 7342#ackermannENTRY ~m := #in~m;~n := #in~n; 7364#L17 assume !(0 == ~m); 7365#L20 assume 0 == ~n; 7345#L21 call #t~ret7 := ackermann(~m - 1, 1);< 7346#ackermannENTRY ~m := #in~m;~n := #in~n; 7446#L17 assume !(0 == ~m); 7444#L20 assume !(0 == ~n); 7327#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 7442#ackermannENTRY ~m := #in~m;~n := #in~n; 7326#L17 assume !(0 == ~m); 7328#L20 assume !(0 == ~n); 7312#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 7373#ackermannENTRY ~m := #in~m;~n := #in~n; 7374#L17 assume !(0 == ~m); 7426#L20 assume 0 == ~n; 7362#L21 call #t~ret7 := ackermann(~m - 1, 1);< 7396#ackermannENTRY ~m := #in~m;~n := #in~n; 7393#L17 assume !(0 == ~m); 7394#L20 assume !(0 == ~n); 7357#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 7415#ackermannENTRY ~m := #in~m;~n := #in~n; 7395#L17 assume !(0 == ~m); 7356#L20 assume 0 == ~n; 7358#L21 call #t~ret7 := ackermann(~m - 1, 1);< 7396#ackermannENTRY ~m := #in~m;~n := #in~n; 7393#L17 assume !(0 == ~m); 7394#L20 assume !(0 == ~n); 7357#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 7415#ackermannENTRY ~m := #in~m;~n := #in~n; 7395#L17 assume !(0 == ~m); 7356#L20 assume 0 == ~n; 7358#L21 call #t~ret7 := ackermann(~m - 1, 1);< 7422#ackermannENTRY ~m := #in~m;~n := #in~n; 7448#L17 assume 0 == ~m;#res := 1 + ~n; 7447#ackermannFINAL assume true; 7445#ackermannEXIT >#43#return; 7443#L21-1 #res := #t~ret7;havoc #t~ret7; 7441#ackermannFINAL assume true; 7433#ackermannEXIT >#45#return; 7430#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 7431#ackermannENTRY ~m := #in~m;~n := #in~n; 7450#L17 assume 0 == ~m;#res := 1 + ~n; 7449#ackermannFINAL assume true; 7429#ackermannEXIT >#47#return; 7424#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 7423#ackermannFINAL assume true; 7419#ackermannEXIT >#43#return; 7418#L21-1 #res := #t~ret7;havoc #t~ret7; 7417#ackermannFINAL assume true; 7413#ackermannEXIT >#45#return; 7411#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 7412#ackermannENTRY ~m := #in~m;~n := #in~n; 7487#L17 assume !(0 == ~m); 7486#L20 assume !(0 == ~n); 7321#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 7355#ackermannENTRY ~m := #in~m;~n := #in~n; 7403#L17 assume !(0 == ~m); 7402#L20 assume 0 == ~n; 7343#L21 call #t~ret7 := ackermann(~m - 1, 1);< 7344#ackermannENTRY ~m := #in~m;~n := #in~n; 7457#L17 assume 0 == ~m;#res := 1 + ~n; 7400#ackermannFINAL assume true; 7456#ackermannEXIT >#43#return; 7351#L21-1 #res := #t~ret7;havoc #t~ret7; 7315#ackermannFINAL assume true; 7322#ackermannEXIT >#45#return; 7309#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 7306#ackermannENTRY ~m := #in~m;~n := #in~n; 7310#L17 assume 0 == ~m;#res := 1 + ~n; 7325#ackermannFINAL assume true; 7466#ackermannEXIT >#47#return; 7468#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 7480#ackermannFINAL assume true; 7479#ackermannEXIT >#47#return; 7477#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 7476#ackermannFINAL assume true; 7472#ackermannEXIT >#43#return; 7470#L21-1 #res := #t~ret7;havoc #t~ret7; 7469#ackermannFINAL assume true; 7463#ackermannEXIT >#45#return; 7338#L23-1 [2021-08-27 16:27:57,976 INFO L793 eck$LassoCheckResult]: Loop: 7338#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 7389#ackermannENTRY ~m := #in~m;~n := #in~n; 7379#L17 assume !(0 == ~m); 7377#L20 assume 0 == ~n; 7332#L21 call #t~ret7 := ackermann(~m - 1, 1);< 7401#ackermannENTRY ~m := #in~m;~n := #in~n; 7399#L17 assume !(0 == ~m); 7329#L20 assume !(0 == ~n); 7334#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 7416#ackermannENTRY ~m := #in~m;~n := #in~n; 7438#L17 assume !(0 == ~m); 7439#L20 assume !(0 == ~n); 7381#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 7385#ackermannENTRY ~m := #in~m;~n := #in~n; 7380#L17 assume !(0 == ~m); 7384#L20 assume 0 == ~n; 7330#L21 call #t~ret7 := ackermann(~m - 1, 1);< 7401#ackermannENTRY ~m := #in~m;~n := #in~n; 7399#L17 assume !(0 == ~m); 7329#L20 assume !(0 == ~n); 7334#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 7416#ackermannENTRY ~m := #in~m;~n := #in~n; 7438#L17 assume !(0 == ~m); 7437#L20 assume 0 == ~n; 7331#L21 call #t~ret7 := ackermann(~m - 1, 1);< 7401#ackermannENTRY ~m := #in~m;~n := #in~n; 7399#L17 assume !(0 == ~m); 7329#L20 assume !(0 == ~n); 7334#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 7416#ackermannENTRY ~m := #in~m;~n := #in~n; 7438#L17 assume !(0 == ~m); 7437#L20 assume 0 == ~n; 7331#L21 call #t~ret7 := ackermann(~m - 1, 1);< 7401#ackermannENTRY ~m := #in~m;~n := #in~n; 7399#L17 assume 0 == ~m;#res := 1 + ~n; 7400#ackermannFINAL assume true; 7456#ackermannEXIT >#43#return; 7455#L21-1 #res := #t~ret7;havoc #t~ret7; 7454#ackermannFINAL assume true; 7453#ackermannEXIT >#45#return; 7435#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 7436#ackermannENTRY ~m := #in~m;~n := #in~n; 7452#L17 assume 0 == ~m;#res := 1 + ~n; 7451#ackermannFINAL assume true; 7434#ackermannEXIT >#47#return; 7432#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 7425#ackermannFINAL assume true; 7420#ackermannEXIT >#43#return; 7418#L21-1 #res := #t~ret7;havoc #t~ret7; 7417#ackermannFINAL assume true; 7413#ackermannEXIT >#45#return; 7411#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 7412#ackermannENTRY ~m := #in~m;~n := #in~n; 7487#L17 assume !(0 == ~m); 7486#L20 assume !(0 == ~n); 7321#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 7355#ackermannENTRY ~m := #in~m;~n := #in~n; 7403#L17 assume !(0 == ~m); 7402#L20 assume 0 == ~n; 7343#L21 call #t~ret7 := ackermann(~m - 1, 1);< 7344#ackermannENTRY ~m := #in~m;~n := #in~n; 7457#L17 assume 0 == ~m;#res := 1 + ~n; 7400#ackermannFINAL assume true; 7456#ackermannEXIT >#43#return; 7351#L21-1 #res := #t~ret7;havoc #t~ret7; 7315#ackermannFINAL assume true; 7322#ackermannEXIT >#45#return; 7309#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 7306#ackermannENTRY ~m := #in~m;~n := #in~n; 7310#L17 assume 0 == ~m;#res := 1 + ~n; 7325#ackermannFINAL assume true; 7466#ackermannEXIT >#47#return; 7468#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 7480#ackermannFINAL assume true; 7479#ackermannEXIT >#47#return; 7477#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 7476#ackermannFINAL assume true; 7472#ackermannEXIT >#43#return; 7470#L21-1 #res := #t~ret7;havoc #t~ret7; 7469#ackermannFINAL assume true; 7463#ackermannEXIT >#45#return; 7338#L23-1 [2021-08-27 16:27:57,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:27:57,976 INFO L82 PathProgramCache]: Analyzing trace with hash 2029382637, now seen corresponding path program 5 times [2021-08-27 16:27:57,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:27:57,976 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562190035] [2021-08-27 16:27:57,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:27:57,977 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:27:57,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:58,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-08-27 16:27:58,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:58,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:27:58,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:58,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:27:58,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:58,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:27:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:58,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:27:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:58,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:27:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:58,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:27:58,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:58,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 16:27:58,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:58,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:27:58,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:58,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:27:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:58,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:27:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:58,088 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 32 proven. 87 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2021-08-27 16:27:58,088 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:27:58,089 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562190035] [2021-08-27 16:27:58,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562190035] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 16:27:58,089 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016362873] [2021-08-27 16:27:58,089 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-27 16:27:58,089 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 16:27:58,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:58,092 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) [2021-08-27 16:27:58,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (159)] Waiting until timeout for monitored process [2021-08-27 16:27:58,672 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2021-08-27 16:27:58,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 16:27:58,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 16:27:58,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:27:58,902 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 36 proven. 83 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2021-08-27 16:27:58,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016362873] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 16:27:58,903 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 16:27:58,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-08-27 16:27:58,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364508864] [2021-08-27 16:27:58,903 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:27:58,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:27:58,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1345023226, now seen corresponding path program 3 times [2021-08-27 16:27:58,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:27:58,904 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414485647] [2021-08-27 16:27:58,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:27:58,904 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:27:58,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:58,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 16:27:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:58,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:27:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:58,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:27:58,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:58,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:27:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:58,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:27:58,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:58,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:27:58,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:58,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:27:58,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:58,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 16:27:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:59,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:27:59,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:59,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:27:59,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:59,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:27:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:27:59,012 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 36 proven. 83 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-08-27 16:27:59,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:27:59,013 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414485647] [2021-08-27 16:27:59,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414485647] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 16:27:59,013 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787007010] [2021-08-27 16:27:59,013 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-27 16:27:59,014 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 16:27:59,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:27:59,017 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) [2021-08-27 16:27:59,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (160)] Waiting until timeout for monitored process [2021-08-27 16:27:59,656 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2021-08-27 16:27:59,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 16:27:59,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 19 conjunts are in the unsatisfiable core [2021-08-27 16:27:59,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:28:00,037 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 112 proven. 69 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2021-08-27 16:28:00,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787007010] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 16:28:00,039 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 16:28:00,039 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13] total 17 [2021-08-27 16:28:00,039 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641933723] [2021-08-27 16:28:00,039 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:28:00,040 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:28:00,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-08-27 16:28:00,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2021-08-27 16:28:00,040 INFO L87 Difference]: Start difference. First operand 184 states and 240 transitions. cyclomatic complexity: 61 Second operand has 17 states, 15 states have (on average 2.466666666666667) internal successors, (37), 12 states have internal predecessors, (37), 9 states have call successors, (12), 3 states have call predecessors, (12), 8 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2021-08-27 16:28:00,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:28:00,400 INFO L93 Difference]: Finished difference Result 216 states and 293 transitions. [2021-08-27 16:28:00,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-08-27 16:28:00,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 216 states and 293 transitions. [2021-08-27 16:28:00,402 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2021-08-27 16:28:00,404 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 216 states to 200 states and 266 transitions. [2021-08-27 16:28:00,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 133 [2021-08-27 16:28:00,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 133 [2021-08-27 16:28:00,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 200 states and 266 transitions. [2021-08-27 16:28:00,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:28:00,406 INFO L681 BuchiCegarLoop]: Abstraction has 200 states and 266 transitions. [2021-08-27 16:28:00,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states and 266 transitions. [2021-08-27 16:28:00,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 175. [2021-08-27 16:28:00,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 117 states have (on average 1.0854700854700854) internal successors, (127), 119 states have internal predecessors, (127), 36 states have call successors, (41), 24 states have call predecessors, (41), 22 states have return successors, (57), 31 states have call predecessors, (57), 29 states have call successors, (57) [2021-08-27 16:28:00,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 225 transitions. [2021-08-27 16:28:00,412 INFO L704 BuchiCegarLoop]: Abstraction has 175 states and 225 transitions. [2021-08-27 16:28:00,412 INFO L587 BuchiCegarLoop]: Abstraction has 175 states and 225 transitions. [2021-08-27 16:28:00,412 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-08-27 16:28:00,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 175 states and 225 transitions. [2021-08-27 16:28:00,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2021-08-27 16:28:00,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:28:00,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:28:00,414 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [14, 13, 9, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2021-08-27 16:28:00,415 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [14, 13, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4] [2021-08-27 16:28:00,415 INFO L791 eck$LassoCheckResult]: Stem: 8746#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 8747#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet10;havoc main_#t~nondet10; 8764#L29 assume !(main_~m~0 < 0 || main_~m~0 > 3);main_~n~0 := main_#t~nondet11;havoc main_#t~nondet11; 8765#L35 assume !(main_~n~0 < 0 || main_~n~0 > 23); 8782#L41 call main_#t~ret12 := ackermann(main_~m~0, main_~n~0);< 8783#ackermannENTRY ~m := #in~m;~n := #in~n; 8807#L17 assume !(0 == ~m); 8805#L20 assume !(0 == ~n); 8761#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 8801#ackermannENTRY ~m := #in~m;~n := #in~n; 8802#L17 assume !(0 == ~m); 8795#L20 assume 0 == ~n; 8796#L21 call #t~ret7 := ackermann(~m - 1, 1);< 8840#ackermannENTRY ~m := #in~m;~n := #in~n; 8838#L17 assume !(0 == ~m); 8839#L20 assume !(0 == ~n); 8781#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 8844#ackermannENTRY ~m := #in~m;~n := #in~n; 8862#L17 assume !(0 == ~m); 8793#L20 assume 0 == ~n; 8794#L21 call #t~ret7 := ackermann(~m - 1, 1);< 8840#ackermannENTRY ~m := #in~m;~n := #in~n; 8838#L17 assume !(0 == ~m); 8839#L20 assume !(0 == ~n); 8781#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 8844#ackermannENTRY ~m := #in~m;~n := #in~n; 8862#L17 assume !(0 == ~m); 8793#L20 assume 0 == ~n; 8794#L21 call #t~ret7 := ackermann(~m - 1, 1);< 8851#ackermannENTRY ~m := #in~m;~n := #in~n; 8879#L17 assume 0 == ~m;#res := 1 + ~n; 8877#ackermannFINAL assume true; 8875#ackermannEXIT >#43#return; 8874#L21-1 #res := #t~ret7;havoc #t~ret7; 8873#ackermannFINAL assume true; 8871#ackermannEXIT >#45#return; 8858#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 8859#ackermannENTRY ~m := #in~m;~n := #in~n; 8868#L17 assume 0 == ~m;#res := 1 + ~n; 8867#ackermannFINAL assume true; 8857#ackermannEXIT >#47#return; 8855#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 8853#ackermannFINAL assume true; 8850#ackermannEXIT >#43#return; 8847#L21-1 #res := #t~ret7;havoc #t~ret7; 8846#ackermannFINAL assume true; 8841#ackermannEXIT >#45#return; 8823#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 8822#ackermannENTRY ~m := #in~m;~n := #in~n; 8824#L17 assume !(0 == ~m); 8914#L20 assume !(0 == ~n); 8772#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 8819#ackermannENTRY ~m := #in~m;~n := #in~n; 8820#L17 assume !(0 == ~m); 8821#L20 assume !(0 == ~n); 8771#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 8819#ackermannENTRY ~m := #in~m;~n := #in~n; 8818#L17 assume !(0 == ~m); 8817#L20 assume 0 == ~n; 8784#L21 call #t~ret7 := ackermann(~m - 1, 1);< 8785#ackermannENTRY ~m := #in~m;~n := #in~n; 8885#L17 assume 0 == ~m;#res := 1 + ~n; 8815#ackermannFINAL assume true; 8883#ackermannEXIT >#43#return; 8884#L21-1 #res := #t~ret7;havoc #t~ret7; 8919#ackermannFINAL assume true; 8918#ackermannEXIT >#45#return; 8749#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 8748#ackermannENTRY ~m := #in~m;~n := #in~n; 8752#L17 assume 0 == ~m;#res := 1 + ~n; 8773#ackermannFINAL assume true; 8898#ackermannEXIT >#47#return; 8899#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 8920#ackermannFINAL assume true; 8901#ackermannEXIT >#45#return; 8750#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 8748#ackermannENTRY ~m := #in~m;~n := #in~n; 8752#L17 assume 0 == ~m;#res := 1 + ~n; 8773#ackermannFINAL assume true; 8898#ackermannEXIT >#47#return; 8900#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 8913#ackermannFINAL assume true; 8912#ackermannEXIT >#47#return; 8910#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 8909#ackermannFINAL assume true; 8908#ackermannEXIT >#43#return; 8789#L21-1 #res := #t~ret7;havoc #t~ret7; 8790#ackermannFINAL assume true; 8766#ackermannEXIT >#45#return; 8768#L23-1 [2021-08-27 16:28:00,415 INFO L793 eck$LassoCheckResult]: Loop: 8768#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 8833#ackermannENTRY ~m := #in~m;~n := #in~n; 8835#L17 assume !(0 == ~m); 8836#L20 assume !(0 == ~n); 8759#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 8828#ackermannENTRY ~m := #in~m;~n := #in~n; 8830#L17 assume !(0 == ~m); 8854#L20 assume 0 == ~n; 8778#L21 call #t~ret7 := ackermann(~m - 1, 1);< 8816#ackermannENTRY ~m := #in~m;~n := #in~n; 8814#L17 assume !(0 == ~m); 8775#L20 assume !(0 == ~n); 8779#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 8845#ackermannENTRY ~m := #in~m;~n := #in~n; 8860#L17 assume !(0 == ~m); 8856#L20 assume 0 == ~n; 8777#L21 call #t~ret7 := ackermann(~m - 1, 1);< 8816#ackermannENTRY ~m := #in~m;~n := #in~n; 8814#L17 assume !(0 == ~m); 8775#L20 assume !(0 == ~n); 8779#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 8845#ackermannENTRY ~m := #in~m;~n := #in~n; 8860#L17 assume !(0 == ~m); 8856#L20 assume 0 == ~n; 8777#L21 call #t~ret7 := ackermann(~m - 1, 1);< 8816#ackermannENTRY ~m := #in~m;~n := #in~n; 8814#L17 assume 0 == ~m;#res := 1 + ~n; 8815#ackermannFINAL assume true; 8883#ackermannEXIT >#43#return; 8882#L21-1 #res := #t~ret7;havoc #t~ret7; 8881#ackermannFINAL assume true; 8880#ackermannEXIT >#45#return; 8865#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 8866#ackermannENTRY ~m := #in~m;~n := #in~n; 8878#L17 assume 0 == ~m;#res := 1 + ~n; 8876#ackermannFINAL assume true; 8864#ackermannEXIT >#47#return; 8863#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 8852#ackermannFINAL assume true; 8848#ackermannEXIT >#43#return; 8847#L21-1 #res := #t~ret7;havoc #t~ret7; 8846#ackermannFINAL assume true; 8841#ackermannEXIT >#45#return; 8823#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 8822#ackermannENTRY ~m := #in~m;~n := #in~n; 8824#L17 assume !(0 == ~m); 8914#L20 assume !(0 == ~n); 8772#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 8819#ackermannENTRY ~m := #in~m;~n := #in~n; 8820#L17 assume !(0 == ~m); 8821#L20 assume !(0 == ~n); 8771#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 8819#ackermannENTRY ~m := #in~m;~n := #in~n; 8818#L17 assume !(0 == ~m); 8817#L20 assume 0 == ~n; 8784#L21 call #t~ret7 := ackermann(~m - 1, 1);< 8785#ackermannENTRY ~m := #in~m;~n := #in~n; 8885#L17 assume 0 == ~m;#res := 1 + ~n; 8815#ackermannFINAL assume true; 8883#ackermannEXIT >#43#return; 8884#L21-1 #res := #t~ret7;havoc #t~ret7; 8919#ackermannFINAL assume true; 8918#ackermannEXIT >#45#return; 8749#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 8748#ackermannENTRY ~m := #in~m;~n := #in~n; 8752#L17 assume 0 == ~m;#res := 1 + ~n; 8773#ackermannFINAL assume true; 8898#ackermannEXIT >#47#return; 8899#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 8920#ackermannFINAL assume true; 8901#ackermannEXIT >#45#return; 8750#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 8748#ackermannENTRY ~m := #in~m;~n := #in~n; 8752#L17 assume 0 == ~m;#res := 1 + ~n; 8773#ackermannFINAL assume true; 8898#ackermannEXIT >#47#return; 8900#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 8913#ackermannFINAL assume true; 8912#ackermannEXIT >#47#return; 8910#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 8909#ackermannFINAL assume true; 8908#ackermannEXIT >#43#return; 8789#L21-1 #res := #t~ret7;havoc #t~ret7; 8790#ackermannFINAL assume true; 8766#ackermannEXIT >#45#return; 8768#L23-1 [2021-08-27 16:28:00,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:28:00,416 INFO L82 PathProgramCache]: Analyzing trace with hash 2095171192, now seen corresponding path program 6 times [2021-08-27 16:28:00,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:28:00,416 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773994947] [2021-08-27 16:28:00,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:28:00,416 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:28:00,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:00,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-08-27 16:28:00,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:00,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:00,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:00,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:00,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:00,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:00,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:00,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:00,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:00,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:00,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:00,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:00,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:00,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 16:28:00,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:00,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:00,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:00,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:00,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:00,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:00,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:00,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:00,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 16:28:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:00,687 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 139 proven. 101 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2021-08-27 16:28:00,687 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:28:00,687 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773994947] [2021-08-27 16:28:00,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773994947] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 16:28:00,687 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484220890] [2021-08-27 16:28:00,688 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-27 16:28:00,688 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 16:28:00,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:28:00,689 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) [2021-08-27 16:28:00,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (161)] Waiting until timeout for monitored process [2021-08-27 16:28:01,313 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2021-08-27 16:28:01,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 16:28:01,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 21 conjunts are in the unsatisfiable core [2021-08-27 16:28:01,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:28:01,577 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 125 proven. 109 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2021-08-27 16:28:01,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484220890] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 16:28:01,577 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 16:28:01,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 18 [2021-08-27 16:28:01,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287604931] [2021-08-27 16:28:01,578 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:28:01,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:28:01,578 INFO L82 PathProgramCache]: Analyzing trace with hash -869926651, now seen corresponding path program 4 times [2021-08-27 16:28:01,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:28:01,578 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763344174] [2021-08-27 16:28:01,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:28:01,578 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:28:01,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:01,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 16:28:01,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:01,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:01,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:01,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:01,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:01,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:01,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:01,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:01,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:01,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:01,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:01,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:01,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 16:28:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:01,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:01,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:01,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:01,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:01,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:01,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:01,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:01,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 16:28:01,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:01,838 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 143 proven. 101 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2021-08-27 16:28:01,838 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:28:01,838 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763344174] [2021-08-27 16:28:01,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763344174] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 16:28:01,839 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659999410] [2021-08-27 16:28:01,839 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-27 16:28:01,839 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 16:28:01,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:28:01,844 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) [2021-08-27 16:28:01,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (162)] Waiting until timeout for monitored process [2021-08-27 16:28:02,518 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-27 16:28:02,519 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 16:28:02,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 21 conjunts are in the unsatisfiable core [2021-08-27 16:28:02,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:28:02,772 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 129 proven. 109 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2021-08-27 16:28:02,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659999410] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 16:28:02,772 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 16:28:02,772 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 18 [2021-08-27 16:28:02,773 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554573435] [2021-08-27 16:28:02,773 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:28:02,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:28:02,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-27 16:28:02,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2021-08-27 16:28:02,774 INFO L87 Difference]: Start difference. First operand 175 states and 225 transitions. cyclomatic complexity: 55 Second operand has 18 states, 16 states have (on average 2.25) internal successors, (36), 13 states have internal predecessors, (36), 9 states have call successors, (11), 1 states have call predecessors, (11), 10 states have return successors, (17), 10 states have call predecessors, (17), 9 states have call successors, (17) [2021-08-27 16:28:03,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:28:03,321 INFO L93 Difference]: Finished difference Result 221 states and 305 transitions. [2021-08-27 16:28:03,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-08-27 16:28:03,322 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 221 states and 305 transitions. [2021-08-27 16:28:03,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2021-08-27 16:28:03,326 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 221 states to 205 states and 279 transitions. [2021-08-27 16:28:03,326 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 146 [2021-08-27 16:28:03,327 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 146 [2021-08-27 16:28:03,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 205 states and 279 transitions. [2021-08-27 16:28:03,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:28:03,327 INFO L681 BuchiCegarLoop]: Abstraction has 205 states and 279 transitions. [2021-08-27 16:28:03,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states and 279 transitions. [2021-08-27 16:28:03,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 187. [2021-08-27 16:28:03,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 123 states have (on average 1.08130081300813) internal successors, (133), 125 states have internal predecessors, (133), 39 states have call successors, (44), 24 states have call predecessors, (44), 25 states have return successors, (69), 37 states have call predecessors, (69), 32 states have call successors, (69) [2021-08-27 16:28:03,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 246 transitions. [2021-08-27 16:28:03,338 INFO L704 BuchiCegarLoop]: Abstraction has 187 states and 246 transitions. [2021-08-27 16:28:03,338 INFO L587 BuchiCegarLoop]: Abstraction has 187 states and 246 transitions. [2021-08-27 16:28:03,338 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-08-27 16:28:03,338 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 187 states and 246 transitions. [2021-08-27 16:28:03,339 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2021-08-27 16:28:03,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:28:03,339 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:28:03,341 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [16, 15, 10, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2021-08-27 16:28:03,341 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [59, 58, 35, 24, 24, 24, 24, 24, 23, 23, 11, 11, 11, 11] [2021-08-27 16:28:03,342 INFO L791 eck$LassoCheckResult]: Stem: 10364#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 10365#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet10;havoc main_#t~nondet10; 10380#L29 assume !(main_~m~0 < 0 || main_~m~0 > 3);main_~n~0 := main_#t~nondet11;havoc main_#t~nondet11; 10381#L35 assume !(main_~n~0 < 0 || main_~n~0 > 23); 10399#L41 call main_#t~ret12 := ackermann(main_~m~0, main_~n~0);< 10400#ackermannENTRY ~m := #in~m;~n := #in~n; 10425#L17 assume !(0 == ~m); 10423#L20 assume !(0 == ~n); 10405#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 10419#ackermannENTRY ~m := #in~m;~n := #in~n; 10420#L17 assume !(0 == ~m); 10413#L20 assume 0 == ~n; 10414#L21 call #t~ret7 := ackermann(~m - 1, 1);< 10465#ackermannENTRY ~m := #in~m;~n := #in~n; 10464#L17 assume !(0 == ~m); 10461#L20 assume !(0 == ~n); 10412#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 10449#ackermannENTRY ~m := #in~m;~n := #in~n; 10466#L17 assume !(0 == ~m); 10411#L20 assume 0 == ~n; 10367#L21 call #t~ret7 := ackermann(~m - 1, 1);< 10465#ackermannENTRY ~m := #in~m;~n := #in~n; 10464#L17 assume !(0 == ~m); 10461#L20 assume !(0 == ~n); 10412#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 10449#ackermannENTRY ~m := #in~m;~n := #in~n; 10466#L17 assume !(0 == ~m); 10411#L20 assume 0 == ~n; 10367#L21 call #t~ret7 := ackermann(~m - 1, 1);< 10366#ackermannENTRY ~m := #in~m;~n := #in~n; 10368#L17 assume 0 == ~m;#res := 1 + ~n; 10504#ackermannFINAL assume true; 10503#ackermannEXIT >#43#return; 10501#L21-1 #res := #t~ret7;havoc #t~ret7; 10500#ackermannFINAL assume true; 10486#ackermannEXIT >#45#return; 10483#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 10484#ackermannENTRY ~m := #in~m;~n := #in~n; 10499#L17 assume 0 == ~m;#res := 1 + ~n; 10498#ackermannFINAL assume true; 10482#ackermannEXIT >#47#return; 10481#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 10477#ackermannFINAL assume true; 10474#ackermannEXIT >#43#return; 10473#L21-1 #res := #t~ret7;havoc #t~ret7; 10472#ackermannFINAL assume true; 10468#ackermannEXIT >#45#return; 10469#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 10514#ackermannENTRY ~m := #in~m;~n := #in~n; 10534#L17 assume !(0 == ~m); 10532#L20 assume !(0 == ~n); 10373#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 10440#ackermannENTRY ~m := #in~m;~n := #in~n; 10441#L17 assume !(0 == ~m); 10442#L20 assume !(0 == ~n); 10378#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 10440#ackermannENTRY ~m := #in~m;~n := #in~n; 10441#L17 assume !(0 == ~m); 10442#L20 assume !(0 == ~n); 10378#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 10440#ackermannENTRY ~m := #in~m;~n := #in~n; 10439#L17 assume !(0 == ~m); 10438#L20 assume 0 == ~n; 10401#L21 call #t~ret7 := ackermann(~m - 1, 1);< 10402#ackermannENTRY ~m := #in~m;~n := #in~n; 10497#L17 assume 0 == ~m;#res := 1 + ~n; 10436#ackermannFINAL assume true; 10495#ackermannEXIT >#43#return; 10496#L21-1 #res := #t~ret7;havoc #t~ret7; 10550#ackermannFINAL assume true; 10549#ackermannEXIT >#45#return; 10383#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 10384#ackermannENTRY ~m := #in~m;~n := #in~n; 10385#L17 assume 0 == ~m;#res := 1 + ~n; 10388#ackermannFINAL assume true; 10526#ackermannEXIT >#47#return; 10403#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 10372#ackermannFINAL assume true; 10379#ackermannEXIT >#45#return; 10382#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 10384#ackermannENTRY ~m := #in~m;~n := #in~n; 10385#L17 assume 0 == ~m;#res := 1 + ~n; 10388#ackermannFINAL assume true; 10526#ackermannEXIT >#47#return; 10527#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 10544#ackermannFINAL assume true; 10530#ackermannEXIT >#45#return; 10386#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 10384#ackermannENTRY ~m := #in~m;~n := #in~n; 10385#L17 assume 0 == ~m;#res := 1 + ~n; 10388#ackermannFINAL assume true; 10526#ackermannEXIT >#47#return; 10518#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 10516#ackermannFINAL assume true; 10512#ackermannEXIT >#47#return; 10510#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 10509#ackermannFINAL assume true; 10507#ackermannEXIT >#43#return; 10404#L21-1 #res := #t~ret7;havoc #t~ret7; 10408#ackermannFINAL assume true; 10547#ackermannEXIT >#45#return; 10427#L23-1 [2021-08-27 16:28:03,342 INFO L793 eck$LassoCheckResult]: Loop: 10427#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 10453#ackermannENTRY ~m := #in~m;~n := #in~n; 10454#L17 assume !(0 == ~m); 10540#L20 assume !(0 == ~n); 10374#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 10455#ackermannENTRY ~m := #in~m;~n := #in~n; 10456#L17 assume !(0 == ~m); 10460#L20 assume !(0 == ~n); 10377#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 10455#ackermannENTRY ~m := #in~m;~n := #in~n; 10457#L17 assume !(0 == ~m); 10480#L20 assume 0 == ~n; 10396#L21 call #t~ret7 := ackermann(~m - 1, 1);< 10437#ackermannENTRY ~m := #in~m;~n := #in~n; 10435#L17 assume !(0 == ~m); 10393#L20 assume !(0 == ~n); 10397#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 10471#ackermannENTRY ~m := #in~m;~n := #in~n; 10502#L17 assume !(0 == ~m); 10479#L20 assume 0 == ~n; 10395#L21 call #t~ret7 := ackermann(~m - 1, 1);< 10437#ackermannENTRY ~m := #in~m;~n := #in~n; 10435#L17 assume !(0 == ~m); 10393#L20 assume !(0 == ~n); 10397#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 10471#ackermannENTRY ~m := #in~m;~n := #in~n; 10502#L17 assume !(0 == ~m); 10479#L20 assume 0 == ~n; 10395#L21 call #t~ret7 := ackermann(~m - 1, 1);< 10437#ackermannENTRY ~m := #in~m;~n := #in~n; 10435#L17 assume 0 == ~m;#res := 1 + ~n; 10436#ackermannFINAL assume true; 10495#ackermannEXIT >#43#return; 10494#L21-1 #res := #t~ret7;havoc #t~ret7; 10493#ackermannFINAL assume true; 10491#ackermannEXIT >#45#return; 10488#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 10489#ackermannENTRY ~m := #in~m;~n := #in~n; 10492#L17 assume 0 == ~m;#res := 1 + ~n; 10490#ackermannFINAL assume true; 10487#ackermannEXIT >#47#return; 10485#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 10478#ackermannFINAL assume true; 10475#ackermannEXIT >#43#return; 10473#L21-1 #res := #t~ret7;havoc #t~ret7; 10472#ackermannFINAL assume true; 10468#ackermannEXIT >#45#return; 10469#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 10514#ackermannENTRY ~m := #in~m;~n := #in~n; 10534#L17 assume !(0 == ~m); 10532#L20 assume !(0 == ~n); 10373#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 10440#ackermannENTRY ~m := #in~m;~n := #in~n; 10441#L17 assume !(0 == ~m); 10442#L20 assume !(0 == ~n); 10378#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 10440#ackermannENTRY ~m := #in~m;~n := #in~n; 10441#L17 assume !(0 == ~m); 10442#L20 assume !(0 == ~n); 10378#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 10440#ackermannENTRY ~m := #in~m;~n := #in~n; 10439#L17 assume !(0 == ~m); 10438#L20 assume 0 == ~n; 10401#L21 call #t~ret7 := ackermann(~m - 1, 1);< 10402#ackermannENTRY ~m := #in~m;~n := #in~n; 10497#L17 assume 0 == ~m;#res := 1 + ~n; 10436#ackermannFINAL assume true; 10495#ackermannEXIT >#43#return; 10496#L21-1 #res := #t~ret7;havoc #t~ret7; 10550#ackermannFINAL assume true; 10549#ackermannEXIT >#45#return; 10383#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 10384#ackermannENTRY ~m := #in~m;~n := #in~n; 10385#L17 assume 0 == ~m;#res := 1 + ~n; 10388#ackermannFINAL assume true; 10526#ackermannEXIT >#47#return; 10403#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 10372#ackermannFINAL assume true; 10379#ackermannEXIT >#45#return; 10382#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 10384#ackermannENTRY ~m := #in~m;~n := #in~n; 10385#L17 assume 0 == ~m;#res := 1 + ~n; 10388#ackermannFINAL assume true; 10526#ackermannEXIT >#47#return; 10527#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 10544#ackermannFINAL assume true; 10530#ackermannEXIT >#45#return; 10386#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 10384#ackermannENTRY ~m := #in~m;~n := #in~n; 10385#L17 assume 0 == ~m;#res := 1 + ~n; 10388#ackermannFINAL assume true; 10526#ackermannEXIT >#47#return; 10518#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 10516#ackermannFINAL assume true; 10512#ackermannEXIT >#47#return; 10510#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 10509#ackermannFINAL assume true; 10507#ackermannEXIT >#43#return; 10404#L21-1 #res := #t~ret7;havoc #t~ret7; 10408#ackermannFINAL assume true; 10547#ackermannEXIT >#45#return; 10428#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 10453#ackermannENTRY ~m := #in~m;~n := #in~n; 10454#L17 assume !(0 == ~m); 10540#L20 assume !(0 == ~n); 10374#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 10455#ackermannENTRY ~m := #in~m;~n := #in~n; 10456#L17 assume !(0 == ~m); 10460#L20 assume !(0 == ~n); 10377#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 10455#ackermannENTRY ~m := #in~m;~n := #in~n; 10456#L17 assume !(0 == ~m); 10460#L20 assume !(0 == ~n); 10377#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 10455#ackermannENTRY ~m := #in~m;~n := #in~n; 10457#L17 assume !(0 == ~m); 10480#L20 assume 0 == ~n; 10396#L21 call #t~ret7 := ackermann(~m - 1, 1);< 10437#ackermannENTRY ~m := #in~m;~n := #in~n; 10435#L17 assume !(0 == ~m); 10393#L20 assume !(0 == ~n); 10397#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 10471#ackermannENTRY ~m := #in~m;~n := #in~n; 10502#L17 assume !(0 == ~m); 10479#L20 assume 0 == ~n; 10395#L21 call #t~ret7 := ackermann(~m - 1, 1);< 10437#ackermannENTRY ~m := #in~m;~n := #in~n; 10435#L17 assume !(0 == ~m); 10393#L20 assume !(0 == ~n); 10397#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 10471#ackermannENTRY ~m := #in~m;~n := #in~n; 10502#L17 assume !(0 == ~m); 10479#L20 assume 0 == ~n; 10395#L21 call #t~ret7 := ackermann(~m - 1, 1);< 10437#ackermannENTRY ~m := #in~m;~n := #in~n; 10435#L17 assume 0 == ~m;#res := 1 + ~n; 10436#ackermannFINAL assume true; 10495#ackermannEXIT >#43#return; 10494#L21-1 #res := #t~ret7;havoc #t~ret7; 10493#ackermannFINAL assume true; 10491#ackermannEXIT >#45#return; 10488#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 10489#ackermannENTRY ~m := #in~m;~n := #in~n; 10492#L17 assume 0 == ~m;#res := 1 + ~n; 10490#ackermannFINAL assume true; 10487#ackermannEXIT >#47#return; 10485#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 10478#ackermannFINAL assume true; 10475#ackermannEXIT >#43#return; 10473#L21-1 #res := #t~ret7;havoc #t~ret7; 10472#ackermannFINAL assume true; 10468#ackermannEXIT >#45#return; 10469#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 10514#ackermannENTRY ~m := #in~m;~n := #in~n; 10534#L17 assume !(0 == ~m); 10532#L20 assume !(0 == ~n); 10373#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 10440#ackermannENTRY ~m := #in~m;~n := #in~n; 10441#L17 assume !(0 == ~m); 10442#L20 assume !(0 == ~n); 10378#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 10440#ackermannENTRY ~m := #in~m;~n := #in~n; 10441#L17 assume !(0 == ~m); 10442#L20 assume !(0 == ~n); 10378#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 10440#ackermannENTRY ~m := #in~m;~n := #in~n; 10439#L17 assume !(0 == ~m); 10438#L20 assume 0 == ~n; 10401#L21 call #t~ret7 := ackermann(~m - 1, 1);< 10402#ackermannENTRY ~m := #in~m;~n := #in~n; 10497#L17 assume 0 == ~m;#res := 1 + ~n; 10436#ackermannFINAL assume true; 10495#ackermannEXIT >#43#return; 10496#L21-1 #res := #t~ret7;havoc #t~ret7; 10550#ackermannFINAL assume true; 10549#ackermannEXIT >#45#return; 10383#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 10384#ackermannENTRY ~m := #in~m;~n := #in~n; 10385#L17 assume 0 == ~m;#res := 1 + ~n; 10388#ackermannFINAL assume true; 10526#ackermannEXIT >#47#return; 10403#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 10372#ackermannFINAL assume true; 10379#ackermannEXIT >#45#return; 10382#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 10384#ackermannENTRY ~m := #in~m;~n := #in~n; 10385#L17 assume 0 == ~m;#res := 1 + ~n; 10388#ackermannFINAL assume true; 10526#ackermannEXIT >#47#return; 10527#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 10544#ackermannFINAL assume true; 10530#ackermannEXIT >#45#return; 10386#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 10384#ackermannENTRY ~m := #in~m;~n := #in~n; 10385#L17 assume 0 == ~m;#res := 1 + ~n; 10388#ackermannFINAL assume true; 10526#ackermannEXIT >#47#return; 10518#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 10516#ackermannFINAL assume true; 10512#ackermannEXIT >#47#return; 10510#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 10509#ackermannFINAL assume true; 10507#ackermannEXIT >#43#return; 10404#L21-1 #res := #t~ret7;havoc #t~ret7; 10408#ackermannFINAL assume true; 10547#ackermannEXIT >#45#return; 10428#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 10453#ackermannENTRY ~m := #in~m;~n := #in~n; 10454#L17 assume !(0 == ~m); 10540#L20 assume !(0 == ~n); 10374#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 10455#ackermannENTRY ~m := #in~m;~n := #in~n; 10456#L17 assume !(0 == ~m); 10460#L20 assume !(0 == ~n); 10377#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 10455#ackermannENTRY ~m := #in~m;~n := #in~n; 10456#L17 assume !(0 == ~m); 10460#L20 assume !(0 == ~n); 10377#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 10455#ackermannENTRY ~m := #in~m;~n := #in~n; 10457#L17 assume !(0 == ~m); 10480#L20 assume 0 == ~n; 10396#L21 call #t~ret7 := ackermann(~m - 1, 1);< 10437#ackermannENTRY ~m := #in~m;~n := #in~n; 10435#L17 assume 0 == ~m;#res := 1 + ~n; 10436#ackermannFINAL assume true; 10495#ackermannEXIT >#43#return; 10496#L21-1 #res := #t~ret7;havoc #t~ret7; 10550#ackermannFINAL assume true; 10549#ackermannEXIT >#45#return; 10383#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 10384#ackermannENTRY ~m := #in~m;~n := #in~n; 10385#L17 assume 0 == ~m;#res := 1 + ~n; 10388#ackermannFINAL assume true; 10526#ackermannEXIT >#47#return; 10403#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 10372#ackermannFINAL assume true; 10379#ackermannEXIT >#45#return; 10382#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 10384#ackermannENTRY ~m := #in~m;~n := #in~n; 10385#L17 assume 0 == ~m;#res := 1 + ~n; 10388#ackermannFINAL assume true; 10526#ackermannEXIT >#47#return; 10527#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 10544#ackermannFINAL assume true; 10530#ackermannEXIT >#45#return; 10387#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 10384#ackermannENTRY ~m := #in~m;~n := #in~n; 10385#L17 assume 0 == ~m;#res := 1 + ~n; 10388#ackermannFINAL assume true; 10526#ackermannEXIT >#47#return; 10528#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 10538#ackermannFINAL assume true; 10523#ackermannEXIT >#47#return; 10524#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 10548#ackermannFINAL assume true; 10470#ackermannEXIT >#45#return; 10446#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 10443#ackermannENTRY ~m := #in~m;~n := #in~n; 10448#L17 assume !(0 == ~m); 10541#L20 assume !(0 == ~n); 10375#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 10440#ackermannENTRY ~m := #in~m;~n := #in~n; 10441#L17 assume !(0 == ~m); 10442#L20 assume !(0 == ~n); 10378#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 10440#ackermannENTRY ~m := #in~m;~n := #in~n; 10441#L17 assume !(0 == ~m); 10442#L20 assume !(0 == ~n); 10378#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 10440#ackermannENTRY ~m := #in~m;~n := #in~n; 10439#L17 assume !(0 == ~m); 10438#L20 assume 0 == ~n; 10401#L21 call #t~ret7 := ackermann(~m - 1, 1);< 10402#ackermannENTRY ~m := #in~m;~n := #in~n; 10497#L17 assume 0 == ~m;#res := 1 + ~n; 10436#ackermannFINAL assume true; 10495#ackermannEXIT >#43#return; 10496#L21-1 #res := #t~ret7;havoc #t~ret7; 10550#ackermannFINAL assume true; 10549#ackermannEXIT >#45#return; 10383#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 10384#ackermannENTRY ~m := #in~m;~n := #in~n; 10385#L17 assume 0 == ~m;#res := 1 + ~n; 10388#ackermannFINAL assume true; 10526#ackermannEXIT >#47#return; 10403#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 10372#ackermannFINAL assume true; 10379#ackermannEXIT >#45#return; 10382#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 10384#ackermannENTRY ~m := #in~m;~n := #in~n; 10385#L17 assume 0 == ~m;#res := 1 + ~n; 10388#ackermannFINAL assume true; 10526#ackermannEXIT >#47#return; 10527#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 10544#ackermannFINAL assume true; 10530#ackermannEXIT >#45#return; 10387#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 10384#ackermannENTRY ~m := #in~m;~n := #in~n; 10385#L17 assume 0 == ~m;#res := 1 + ~n; 10388#ackermannFINAL assume true; 10526#ackermannEXIT >#47#return; 10528#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 10538#ackermannFINAL assume true; 10523#ackermannEXIT >#47#return; 10525#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 10543#ackermannFINAL assume true; 10529#ackermannEXIT >#45#return; 10447#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 10443#ackermannENTRY ~m := #in~m;~n := #in~n; 10448#L17 assume !(0 == ~m); 10541#L20 assume !(0 == ~n); 10375#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 10440#ackermannENTRY ~m := #in~m;~n := #in~n; 10441#L17 assume !(0 == ~m); 10442#L20 assume !(0 == ~n); 10378#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 10440#ackermannENTRY ~m := #in~m;~n := #in~n; 10441#L17 assume !(0 == ~m); 10442#L20 assume !(0 == ~n); 10378#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 10440#ackermannENTRY ~m := #in~m;~n := #in~n; 10439#L17 assume !(0 == ~m); 10438#L20 assume 0 == ~n; 10401#L21 call #t~ret7 := ackermann(~m - 1, 1);< 10402#ackermannENTRY ~m := #in~m;~n := #in~n; 10497#L17 assume 0 == ~m;#res := 1 + ~n; 10436#ackermannFINAL assume true; 10495#ackermannEXIT >#43#return; 10496#L21-1 #res := #t~ret7;havoc #t~ret7; 10550#ackermannFINAL assume true; 10549#ackermannEXIT >#45#return; 10383#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 10384#ackermannENTRY ~m := #in~m;~n := #in~n; 10385#L17 assume 0 == ~m;#res := 1 + ~n; 10388#ackermannFINAL assume true; 10526#ackermannEXIT >#47#return; 10403#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 10372#ackermannFINAL assume true; 10379#ackermannEXIT >#45#return; 10382#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 10384#ackermannENTRY ~m := #in~m;~n := #in~n; 10385#L17 assume 0 == ~m;#res := 1 + ~n; 10388#ackermannFINAL assume true; 10526#ackermannEXIT >#47#return; 10527#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 10544#ackermannFINAL assume true; 10530#ackermannEXIT >#45#return; 10387#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 10384#ackermannENTRY ~m := #in~m;~n := #in~n; 10385#L17 assume 0 == ~m;#res := 1 + ~n; 10388#ackermannFINAL assume true; 10526#ackermannEXIT >#47#return; 10528#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 10538#ackermannFINAL assume true; 10523#ackermannEXIT >#47#return; 10522#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 10537#ackermannFINAL assume true; 10519#ackermannEXIT >#47#return; 10520#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 10546#ackermannFINAL assume true; 10545#ackermannEXIT >#45#return; 10427#L23-1 [2021-08-27 16:28:03,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:28:03,345 INFO L82 PathProgramCache]: Analyzing trace with hash 478890302, now seen corresponding path program 7 times [2021-08-27 16:28:03,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:28:03,346 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73031164] [2021-08-27 16:28:03,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:28:03,346 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:28:03,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:28:03,367 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:28:03,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:28:03,392 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:28:03,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:28:03,393 INFO L82 PathProgramCache]: Analyzing trace with hash 888511461, now seen corresponding path program 5 times [2021-08-27 16:28:03,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:28:03,393 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73406500] [2021-08-27 16:28:03,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:28:03,394 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:28:03,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:03,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 16:28:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:03,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:03,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:03,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:03,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:03,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:03,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:03,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:03,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:03,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:03,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:03,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:03,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:03,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:03,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 16:28:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:03,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:03,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:03,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:03,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:03,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:03,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:03,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:03,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 16:28:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:03,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-08-27 16:28:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:03,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-08-27 16:28:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:03,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:03,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:04,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:04,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:04,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:04,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:04,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:04,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:04,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:04,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:04,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:04,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:04,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:04,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:04,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:04,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:04,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:04,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 16:28:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:04,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:04,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:04,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:04,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:04,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:04,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:04,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:04,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 16:28:04,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:04,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-08-27 16:28:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:04,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-08-27 16:28:04,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:04,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:04,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:04,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:04,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:04,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:04,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:04,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:04,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:04,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 16:28:04,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:04,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-08-27 16:28:04,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:04,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-08-27 16:28:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:04,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:04,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:04,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:04,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:04,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:04,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:04,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:04,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:04,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:04,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 16:28:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:04,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-08-27 16:28:04,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:04,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-08-27 16:28:04,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:04,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:04,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:04,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:04,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:04,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:04,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:04,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:04,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:04,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:04,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 16:28:04,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:04,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-08-27 16:28:04,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:04,571 INFO L134 CoverageAnalysis]: Checked inductivity of 8238 backedges. 1382 proven. 1901 refuted. 0 times theorem prover too weak. 4955 trivial. 0 not checked. [2021-08-27 16:28:04,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:28:04,571 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73406500] [2021-08-27 16:28:04,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73406500] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 16:28:04,572 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108657665] [2021-08-27 16:28:04,572 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-27 16:28:04,572 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 16:28:04,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:28:04,574 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) [2021-08-27 16:28:04,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (163)] Waiting until timeout for monitored process [2021-08-27 16:28:05,306 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2021-08-27 16:28:05,307 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 16:28:05,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 37 conjunts are in the unsatisfiable core [2021-08-27 16:28:05,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:28:06,454 INFO L134 CoverageAnalysis]: Checked inductivity of 8238 backedges. 787 proven. 1614 refuted. 0 times theorem prover too weak. 5837 trivial. 0 not checked. [2021-08-27 16:28:06,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108657665] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 16:28:06,454 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 16:28:06,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21] total 35 [2021-08-27 16:28:06,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408868105] [2021-08-27 16:28:06,455 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:28:06,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:28:06,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-08-27 16:28:06,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1076, Unknown=0, NotChecked=0, Total=1190 [2021-08-27 16:28:06,457 INFO L87 Difference]: Start difference. First operand 187 states and 246 transitions. cyclomatic complexity: 64 Second operand has 35 states, 25 states have (on average 2.16) internal successors, (54), 20 states have internal predecessors, (54), 18 states have call successors, (22), 1 states have call predecessors, (22), 18 states have return successors, (42), 28 states have call predecessors, (42), 18 states have call successors, (42) [2021-08-27 16:28:09,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:28:09,092 INFO L93 Difference]: Finished difference Result 343 states and 494 transitions. [2021-08-27 16:28:09,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2021-08-27 16:28:09,093 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 343 states and 494 transitions. [2021-08-27 16:28:09,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 57 [2021-08-27 16:28:09,099 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 343 states to 308 states and 429 transitions. [2021-08-27 16:28:09,099 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 229 [2021-08-27 16:28:09,100 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 232 [2021-08-27 16:28:09,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 308 states and 429 transitions. [2021-08-27 16:28:09,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 16:28:09,100 INFO L681 BuchiCegarLoop]: Abstraction has 308 states and 429 transitions. [2021-08-27 16:28:09,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states and 429 transitions. [2021-08-27 16:28:09,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 260. [2021-08-27 16:28:09,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 167 states have (on average 1.0658682634730539) internal successors, (178), 170 states have internal predecessors, (178), 56 states have call successors, (61), 30 states have call predecessors, (61), 37 states have return successors, (104), 59 states have call predecessors, (104), 48 states have call successors, (104) [2021-08-27 16:28:09,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 343 transitions. [2021-08-27 16:28:09,108 INFO L704 BuchiCegarLoop]: Abstraction has 260 states and 343 transitions. [2021-08-27 16:28:09,108 INFO L587 BuchiCegarLoop]: Abstraction has 260 states and 343 transitions. [2021-08-27 16:28:09,108 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-08-27 16:28:09,108 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 260 states and 343 transitions. [2021-08-27 16:28:09,110 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2021-08-27 16:28:09,110 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:28:09,110 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:28:09,122 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [67, 66, 39, 28, 28, 28, 28, 27, 27, 27, 11, 11, 11, 11, 1, 1, 1, 1, 1] [2021-08-27 16:28:09,122 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [334, 333, 190, 144, 144, 144, 144, 144, 143, 143, 46, 46, 46, 46] [2021-08-27 16:28:09,123 INFO L791 eck$LassoCheckResult]: Stem: 14292#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(14);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 14293#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet10;havoc main_#t~nondet10; 14311#L29 assume !(main_~m~0 < 0 || main_~m~0 > 3);main_~n~0 := main_#t~nondet11;havoc main_#t~nondet11; 14312#L35 assume !(main_~n~0 < 0 || main_~n~0 > 23); 14341#L41 call main_#t~ret12 := ackermann(main_~m~0, main_~n~0);< 14342#ackermannENTRY ~m := #in~m;~n := #in~n; 14378#L17 assume !(0 == ~m); 14376#L20 assume !(0 == ~n); 14305#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14372#ackermannENTRY ~m := #in~m;~n := #in~n; 14373#L17 assume !(0 == ~m); 14367#L20 assume 0 == ~n; 14368#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14393#ackermannENTRY ~m := #in~m;~n := #in~n; 14392#L17 assume !(0 == ~m); 14386#L20 assume !(0 == ~n); 14365#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14401#ackermannENTRY ~m := #in~m;~n := #in~n; 14387#L17 assume !(0 == ~m); 14363#L20 assume 0 == ~n; 14366#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14393#ackermannENTRY ~m := #in~m;~n := #in~n; 14392#L17 assume !(0 == ~m); 14386#L20 assume !(0 == ~n); 14365#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14401#ackermannENTRY ~m := #in~m;~n := #in~n; 14387#L17 assume !(0 == ~m); 14363#L20 assume 0 == ~n; 14366#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14393#ackermannENTRY ~m := #in~m;~n := #in~n; 14392#L17 assume !(0 == ~m); 14386#L20 assume !(0 == ~n); 14365#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14401#ackermannENTRY ~m := #in~m;~n := #in~n; 14387#L17 assume !(0 == ~m); 14363#L20 assume 0 == ~n; 14366#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14405#ackermannENTRY ~m := #in~m;~n := #in~n; 14463#L17 assume 0 == ~m;#res := 1 + ~n; 14462#ackermannFINAL assume true; 14461#ackermannEXIT >#43#return; 14460#L21-1 #res := #t~ret7;havoc #t~ret7; 14459#ackermannFINAL assume true; 14457#ackermannEXIT >#45#return; 14433#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14434#ackermannENTRY ~m := #in~m;~n := #in~n; 14438#L17 assume 0 == ~m;#res := 1 + ~n; 14437#ackermannFINAL assume true; 14432#ackermannEXIT >#47#return; 14428#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14426#ackermannFINAL assume true; 14424#ackermannEXIT >#43#return; 14421#L21-1 #res := #t~ret7;havoc #t~ret7; 14420#ackermannFINAL assume true; 14419#ackermannEXIT >#45#return; 14417#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14418#ackermannENTRY ~m := #in~m;~n := #in~n; 14485#L17 assume !(0 == ~m); 14484#L20 assume !(0 == ~n); 14448#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14453#L17 assume !(0 == ~m); 14452#L20 assume 0 == ~n; 14443#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14445#ackermannENTRY ~m := #in~m;~n := #in~n; 14456#L17 assume 0 == ~m;#res := 1 + ~n; 14447#ackermannFINAL assume true; 14441#ackermannEXIT >#43#return; 14444#L21-1 #res := #t~ret7;havoc #t~ret7; 14492#ackermannFINAL assume true; 14491#ackermannEXIT >#45#return; 14320#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14478#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14489#ackermannFINAL assume true; 14488#ackermannEXIT >#45#return; 14319#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14477#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14516#ackermannFINAL assume true; 14514#ackermannEXIT >#45#return; 14322#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14475#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14466#ackermannFINAL assume true; 14416#ackermannEXIT >#47#return; 14410#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14406#ackermannFINAL assume true; 14404#ackermannEXIT >#43#return; 14403#L21-1 #res := #t~ret7;havoc #t~ret7; 14402#ackermannFINAL assume true; 14395#ackermannEXIT >#45#return; 14396#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14500#ackermannENTRY ~m := #in~m;~n := #in~n; 14518#L17 assume !(0 == ~m); 14517#L20 assume !(0 == ~n); 14357#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14361#ackermannENTRY ~m := #in~m;~n := #in~n; 14362#L17 assume !(0 == ~m); 14379#L20 assume !(0 == ~n); 14356#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14361#ackermannENTRY ~m := #in~m;~n := #in~n; 14362#L17 assume !(0 == ~m); 14379#L20 assume !(0 == ~n); 14356#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14361#ackermannENTRY ~m := #in~m;~n := #in~n; 14362#L17 assume !(0 == ~m); 14379#L20 assume !(0 == ~n); 14356#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14361#ackermannENTRY ~m := #in~m;~n := #in~n; 14360#L17 assume !(0 == ~m); 14359#L20 assume 0 == ~n; 14350#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14355#ackermannENTRY ~m := #in~m;~n := #in~n; 14354#L17 assume !(0 == ~m); 14353#L20 assume !(0 == ~n); 14349#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14351#ackermannENTRY ~m := #in~m;~n := #in~n; 14451#L17 assume !(0 == ~m); 14446#L20 assume 0 == ~n; 14442#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14445#ackermannENTRY ~m := #in~m;~n := #in~n; 14456#L17 assume 0 == ~m;#res := 1 + ~n; 14447#ackermannFINAL assume true; 14441#ackermannEXIT >#43#return; 14440#L21-1 #res := #t~ret7;havoc #t~ret7; 14439#ackermannFINAL assume true; 14436#ackermannEXIT >#45#return; 14430#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14431#ackermannENTRY ~m := #in~m;~n := #in~n; 14458#L17 assume 0 == ~m;#res := 1 + ~n; 14435#ackermannFINAL assume true; 14429#ackermannEXIT >#47#return; 14427#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14425#ackermannFINAL assume true; 14422#ackermannEXIT >#43#return; 14423#L21-1 #res := #t~ret7;havoc #t~ret7; 14539#ackermannFINAL assume true; 14537#ackermannEXIT >#45#return; 14297#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14294#ackermannENTRY ~m := #in~m;~n := #in~n; 14300#L17 assume !(0 == ~m); 14490#L20 assume !(0 == ~n); 14450#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14453#L17 assume !(0 == ~m); 14452#L20 assume 0 == ~n; 14443#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14445#ackermannENTRY ~m := #in~m;~n := #in~n; 14456#L17 assume 0 == ~m;#res := 1 + ~n; 14447#ackermannFINAL assume true; 14441#ackermannEXIT >#43#return; 14444#L21-1 #res := #t~ret7;havoc #t~ret7; 14492#ackermannFINAL assume true; 14491#ackermannEXIT >#45#return; 14320#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14478#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14489#ackermannFINAL assume true; 14488#ackermannEXIT >#45#return; 14319#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14477#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14516#ackermannFINAL assume true; 14514#ackermannEXIT >#45#return; 14324#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14481#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14487#ackermannFINAL assume true; 14483#ackermannEXIT >#45#return; 14321#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14479#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14511#ackermannFINAL assume true; 14506#ackermannEXIT >#47#return; 14508#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14534#ackermannFINAL assume true; 14532#ackermannEXIT >#45#return; 14299#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14294#ackermannENTRY ~m := #in~m;~n := #in~n; 14300#L17 assume !(0 == ~m); 14490#L20 assume !(0 == ~n); 14450#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14453#L17 assume !(0 == ~m); 14452#L20 assume 0 == ~n; 14443#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14445#ackermannENTRY ~m := #in~m;~n := #in~n; 14456#L17 assume 0 == ~m;#res := 1 + ~n; 14447#ackermannFINAL assume true; 14441#ackermannEXIT >#43#return; 14444#L21-1 #res := #t~ret7;havoc #t~ret7; 14492#ackermannFINAL assume true; 14491#ackermannEXIT >#45#return; 14320#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14478#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14489#ackermannFINAL assume true; 14488#ackermannEXIT >#45#return; 14319#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14477#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14516#ackermannFINAL assume true; 14514#ackermannEXIT >#45#return; 14324#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14481#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14487#ackermannFINAL assume true; 14483#ackermannEXIT >#45#return; 14321#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14479#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14511#ackermannFINAL assume true; 14506#ackermannEXIT >#47#return; 14510#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14521#ackermannFINAL assume true; 14520#ackermannEXIT >#45#return; 14295#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14294#ackermannENTRY ~m := #in~m;~n := #in~n; 14300#L17 assume !(0 == ~m); 14490#L20 assume !(0 == ~n); 14450#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14453#L17 assume !(0 == ~m); 14452#L20 assume 0 == ~n; 14443#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14445#ackermannENTRY ~m := #in~m;~n := #in~n; 14456#L17 assume 0 == ~m;#res := 1 + ~n; 14447#ackermannFINAL assume true; 14441#ackermannEXIT >#43#return; 14444#L21-1 #res := #t~ret7;havoc #t~ret7; 14492#ackermannFINAL assume true; 14491#ackermannEXIT >#45#return; 14320#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14478#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14489#ackermannFINAL assume true; 14488#ackermannEXIT >#45#return; 14319#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14477#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14516#ackermannFINAL assume true; 14514#ackermannEXIT >#45#return; 14324#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14481#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14487#ackermannFINAL assume true; 14483#ackermannEXIT >#45#return; 14321#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14479#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14511#ackermannFINAL assume true; 14506#ackermannEXIT >#47#return; 14507#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14519#ackermannFINAL assume true; 14512#ackermannEXIT >#45#return; 14296#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14294#ackermannENTRY ~m := #in~m;~n := #in~n; 14300#L17 assume !(0 == ~m); 14490#L20 assume !(0 == ~n); 14450#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14453#L17 assume !(0 == ~m); 14452#L20 assume 0 == ~n; 14443#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14445#ackermannENTRY ~m := #in~m;~n := #in~n; 14456#L17 assume 0 == ~m;#res := 1 + ~n; 14447#ackermannFINAL assume true; 14441#ackermannEXIT >#43#return; 14444#L21-1 #res := #t~ret7;havoc #t~ret7; 14492#ackermannFINAL assume true; 14491#ackermannEXIT >#45#return; 14320#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14478#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14489#ackermannFINAL assume true; 14488#ackermannEXIT >#45#return; 14319#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14477#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14516#ackermannFINAL assume true; 14514#ackermannEXIT >#45#return; 14324#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14481#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14487#ackermannFINAL assume true; 14483#ackermannEXIT >#45#return; 14321#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14479#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14511#ackermannFINAL assume true; 14506#ackermannEXIT >#47#return; 14504#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14502#ackermannFINAL assume true; 14498#ackermannEXIT >#47#return; 14497#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14496#ackermannFINAL assume true; 14493#ackermannEXIT >#43#return; 14495#L21-1 #res := #t~ret7;havoc #t~ret7; 14546#ackermannFINAL assume true; 14313#ackermannEXIT >#45#return; 14316#L23-1 [2021-08-27 16:28:09,125 INFO L793 eck$LassoCheckResult]: Loop: 14316#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14474#ackermannENTRY ~m := #in~m;~n := #in~n; 14326#L17 assume !(0 == ~m); 14331#L20 assume !(0 == ~n); 14306#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14397#ackermannENTRY ~m := #in~m;~n := #in~n; 14412#L17 assume !(0 == ~m); 14335#L20 assume !(0 == ~n); 14308#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14397#ackermannENTRY ~m := #in~m;~n := #in~n; 14411#L17 assume !(0 == ~m); 14408#L20 assume 0 == ~n; 14400#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14407#ackermannENTRY ~m := #in~m;~n := #in~n; 14469#L17 assume !(0 == ~m); 14465#L20 assume !(0 == ~n); 14302#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14301#ackermannENTRY ~m := #in~m;~n := #in~n; 14303#L17 assume !(0 == ~m); 14467#L20 assume 0 == ~n; 14398#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14343#ackermannENTRY ~m := #in~m;~n := #in~n; 14470#L17 assume !(0 == ~m); 14465#L20 assume !(0 == ~n); 14302#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14301#ackermannENTRY ~m := #in~m;~n := #in~n; 14303#L17 assume !(0 == ~m); 14467#L20 assume 0 == ~n; 14398#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14343#ackermannENTRY ~m := #in~m;~n := #in~n; 14470#L17 assume !(0 == ~m); 14465#L20 assume !(0 == ~n); 14302#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14301#ackermannENTRY ~m := #in~m;~n := #in~n; 14303#L17 assume !(0 == ~m); 14467#L20 assume 0 == ~n; 14398#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14343#ackermannENTRY ~m := #in~m;~n := #in~n; 14470#L17 assume 0 == ~m;#res := 1 + ~n; 14447#ackermannFINAL assume true; 14441#ackermannEXIT >#43#return; 14440#L21-1 #res := #t~ret7;havoc #t~ret7; 14439#ackermannFINAL assume true; 14436#ackermannEXIT >#45#return; 14430#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14431#ackermannENTRY ~m := #in~m;~n := #in~n; 14458#L17 assume 0 == ~m;#res := 1 + ~n; 14435#ackermannFINAL assume true; 14429#ackermannEXIT >#47#return; 14427#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14425#ackermannFINAL assume true; 14422#ackermannEXIT >#43#return; 14421#L21-1 #res := #t~ret7;havoc #t~ret7; 14420#ackermannFINAL assume true; 14419#ackermannEXIT >#45#return; 14417#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14418#ackermannENTRY ~m := #in~m;~n := #in~n; 14485#L17 assume !(0 == ~m); 14484#L20 assume !(0 == ~n); 14448#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14453#L17 assume !(0 == ~m); 14452#L20 assume 0 == ~n; 14443#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14445#ackermannENTRY ~m := #in~m;~n := #in~n; 14456#L17 assume 0 == ~m;#res := 1 + ~n; 14447#ackermannFINAL assume true; 14441#ackermannEXIT >#43#return; 14444#L21-1 #res := #t~ret7;havoc #t~ret7; 14492#ackermannFINAL assume true; 14491#ackermannEXIT >#45#return; 14320#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14478#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14489#ackermannFINAL assume true; 14488#ackermannEXIT >#45#return; 14319#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14477#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14516#ackermannFINAL assume true; 14514#ackermannEXIT >#45#return; 14322#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14475#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14466#ackermannFINAL assume true; 14416#ackermannEXIT >#47#return; 14410#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14406#ackermannFINAL assume true; 14404#ackermannEXIT >#43#return; 14403#L21-1 #res := #t~ret7;havoc #t~ret7; 14402#ackermannFINAL assume true; 14395#ackermannEXIT >#45#return; 14396#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14500#ackermannENTRY ~m := #in~m;~n := #in~n; 14518#L17 assume !(0 == ~m); 14517#L20 assume !(0 == ~n); 14357#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14361#ackermannENTRY ~m := #in~m;~n := #in~n; 14362#L17 assume !(0 == ~m); 14379#L20 assume !(0 == ~n); 14356#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14361#ackermannENTRY ~m := #in~m;~n := #in~n; 14362#L17 assume !(0 == ~m); 14379#L20 assume !(0 == ~n); 14356#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14361#ackermannENTRY ~m := #in~m;~n := #in~n; 14362#L17 assume !(0 == ~m); 14379#L20 assume !(0 == ~n); 14356#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14361#ackermannENTRY ~m := #in~m;~n := #in~n; 14360#L17 assume !(0 == ~m); 14359#L20 assume 0 == ~n; 14350#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14355#ackermannENTRY ~m := #in~m;~n := #in~n; 14354#L17 assume !(0 == ~m); 14353#L20 assume !(0 == ~n); 14349#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14351#ackermannENTRY ~m := #in~m;~n := #in~n; 14451#L17 assume !(0 == ~m); 14446#L20 assume 0 == ~n; 14442#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14445#ackermannENTRY ~m := #in~m;~n := #in~n; 14456#L17 assume 0 == ~m;#res := 1 + ~n; 14447#ackermannFINAL assume true; 14441#ackermannEXIT >#43#return; 14440#L21-1 #res := #t~ret7;havoc #t~ret7; 14439#ackermannFINAL assume true; 14436#ackermannEXIT >#45#return; 14430#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14431#ackermannENTRY ~m := #in~m;~n := #in~n; 14458#L17 assume 0 == ~m;#res := 1 + ~n; 14435#ackermannFINAL assume true; 14429#ackermannEXIT >#47#return; 14427#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14425#ackermannFINAL assume true; 14422#ackermannEXIT >#43#return; 14423#L21-1 #res := #t~ret7;havoc #t~ret7; 14539#ackermannFINAL assume true; 14537#ackermannEXIT >#45#return; 14297#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14294#ackermannENTRY ~m := #in~m;~n := #in~n; 14300#L17 assume !(0 == ~m); 14490#L20 assume !(0 == ~n); 14450#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14453#L17 assume !(0 == ~m); 14452#L20 assume 0 == ~n; 14443#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14445#ackermannENTRY ~m := #in~m;~n := #in~n; 14456#L17 assume 0 == ~m;#res := 1 + ~n; 14447#ackermannFINAL assume true; 14441#ackermannEXIT >#43#return; 14444#L21-1 #res := #t~ret7;havoc #t~ret7; 14492#ackermannFINAL assume true; 14491#ackermannEXIT >#45#return; 14320#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14478#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14489#ackermannFINAL assume true; 14488#ackermannEXIT >#45#return; 14319#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14477#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14516#ackermannFINAL assume true; 14514#ackermannEXIT >#45#return; 14324#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14481#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14487#ackermannFINAL assume true; 14483#ackermannEXIT >#45#return; 14321#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14479#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14511#ackermannFINAL assume true; 14506#ackermannEXIT >#47#return; 14508#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14534#ackermannFINAL assume true; 14532#ackermannEXIT >#45#return; 14299#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14294#ackermannENTRY ~m := #in~m;~n := #in~n; 14300#L17 assume !(0 == ~m); 14490#L20 assume !(0 == ~n); 14450#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14453#L17 assume !(0 == ~m); 14452#L20 assume 0 == ~n; 14443#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14445#ackermannENTRY ~m := #in~m;~n := #in~n; 14456#L17 assume 0 == ~m;#res := 1 + ~n; 14447#ackermannFINAL assume true; 14441#ackermannEXIT >#43#return; 14444#L21-1 #res := #t~ret7;havoc #t~ret7; 14492#ackermannFINAL assume true; 14491#ackermannEXIT >#45#return; 14320#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14478#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14489#ackermannFINAL assume true; 14488#ackermannEXIT >#45#return; 14319#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14477#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14516#ackermannFINAL assume true; 14514#ackermannEXIT >#45#return; 14324#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14481#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14487#ackermannFINAL assume true; 14483#ackermannEXIT >#45#return; 14321#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14479#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14511#ackermannFINAL assume true; 14506#ackermannEXIT >#47#return; 14510#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14521#ackermannFINAL assume true; 14520#ackermannEXIT >#45#return; 14295#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14294#ackermannENTRY ~m := #in~m;~n := #in~n; 14300#L17 assume !(0 == ~m); 14490#L20 assume !(0 == ~n); 14450#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14453#L17 assume !(0 == ~m); 14452#L20 assume 0 == ~n; 14443#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14445#ackermannENTRY ~m := #in~m;~n := #in~n; 14456#L17 assume 0 == ~m;#res := 1 + ~n; 14447#ackermannFINAL assume true; 14441#ackermannEXIT >#43#return; 14444#L21-1 #res := #t~ret7;havoc #t~ret7; 14492#ackermannFINAL assume true; 14491#ackermannEXIT >#45#return; 14320#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14478#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14489#ackermannFINAL assume true; 14488#ackermannEXIT >#45#return; 14319#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14477#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14516#ackermannFINAL assume true; 14514#ackermannEXIT >#45#return; 14324#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14481#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14487#ackermannFINAL assume true; 14483#ackermannEXIT >#45#return; 14321#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14479#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14511#ackermannFINAL assume true; 14506#ackermannEXIT >#47#return; 14507#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14519#ackermannFINAL assume true; 14512#ackermannEXIT >#45#return; 14296#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14294#ackermannENTRY ~m := #in~m;~n := #in~n; 14300#L17 assume !(0 == ~m); 14490#L20 assume !(0 == ~n); 14450#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14453#L17 assume !(0 == ~m); 14452#L20 assume 0 == ~n; 14443#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14445#ackermannENTRY ~m := #in~m;~n := #in~n; 14456#L17 assume 0 == ~m;#res := 1 + ~n; 14447#ackermannFINAL assume true; 14441#ackermannEXIT >#43#return; 14444#L21-1 #res := #t~ret7;havoc #t~ret7; 14492#ackermannFINAL assume true; 14491#ackermannEXIT >#45#return; 14320#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14478#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14489#ackermannFINAL assume true; 14488#ackermannEXIT >#45#return; 14319#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14477#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14516#ackermannFINAL assume true; 14514#ackermannEXIT >#45#return; 14324#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14481#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14487#ackermannFINAL assume true; 14483#ackermannEXIT >#45#return; 14321#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14479#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14511#ackermannFINAL assume true; 14506#ackermannEXIT >#47#return; 14504#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14502#ackermannFINAL assume true; 14498#ackermannEXIT >#47#return; 14497#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14496#ackermannFINAL assume true; 14493#ackermannEXIT >#43#return; 14495#L21-1 #res := #t~ret7;havoc #t~ret7; 14546#ackermannFINAL assume true; 14313#ackermannEXIT >#45#return; 14317#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14474#ackermannENTRY ~m := #in~m;~n := #in~n; 14326#L17 assume !(0 == ~m); 14331#L20 assume !(0 == ~n); 14306#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14397#ackermannENTRY ~m := #in~m;~n := #in~n; 14412#L17 assume !(0 == ~m); 14335#L20 assume !(0 == ~n); 14308#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14397#ackermannENTRY ~m := #in~m;~n := #in~n; 14412#L17 assume !(0 == ~m); 14335#L20 assume !(0 == ~n); 14308#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14397#ackermannENTRY ~m := #in~m;~n := #in~n; 14412#L17 assume !(0 == ~m); 14335#L20 assume !(0 == ~n); 14308#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14397#ackermannENTRY ~m := #in~m;~n := #in~n; 14411#L17 assume !(0 == ~m); 14408#L20 assume 0 == ~n; 14400#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14407#ackermannENTRY ~m := #in~m;~n := #in~n; 14469#L17 assume !(0 == ~m); 14465#L20 assume !(0 == ~n); 14302#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14301#ackermannENTRY ~m := #in~m;~n := #in~n; 14303#L17 assume !(0 == ~m); 14467#L20 assume 0 == ~n; 14398#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14343#ackermannENTRY ~m := #in~m;~n := #in~n; 14470#L17 assume !(0 == ~m); 14465#L20 assume !(0 == ~n); 14302#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14301#ackermannENTRY ~m := #in~m;~n := #in~n; 14303#L17 assume !(0 == ~m); 14467#L20 assume 0 == ~n; 14398#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14343#ackermannENTRY ~m := #in~m;~n := #in~n; 14470#L17 assume !(0 == ~m); 14465#L20 assume !(0 == ~n); 14302#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14301#ackermannENTRY ~m := #in~m;~n := #in~n; 14303#L17 assume !(0 == ~m); 14467#L20 assume 0 == ~n; 14398#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14343#ackermannENTRY ~m := #in~m;~n := #in~n; 14470#L17 assume 0 == ~m;#res := 1 + ~n; 14447#ackermannFINAL assume true; 14441#ackermannEXIT >#43#return; 14440#L21-1 #res := #t~ret7;havoc #t~ret7; 14439#ackermannFINAL assume true; 14436#ackermannEXIT >#45#return; 14430#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14431#ackermannENTRY ~m := #in~m;~n := #in~n; 14458#L17 assume 0 == ~m;#res := 1 + ~n; 14435#ackermannFINAL assume true; 14429#ackermannEXIT >#47#return; 14427#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14425#ackermannFINAL assume true; 14422#ackermannEXIT >#43#return; 14421#L21-1 #res := #t~ret7;havoc #t~ret7; 14420#ackermannFINAL assume true; 14419#ackermannEXIT >#45#return; 14417#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14418#ackermannENTRY ~m := #in~m;~n := #in~n; 14485#L17 assume !(0 == ~m); 14484#L20 assume !(0 == ~n); 14448#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14453#L17 assume !(0 == ~m); 14452#L20 assume 0 == ~n; 14443#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14445#ackermannENTRY ~m := #in~m;~n := #in~n; 14456#L17 assume 0 == ~m;#res := 1 + ~n; 14447#ackermannFINAL assume true; 14441#ackermannEXIT >#43#return; 14444#L21-1 #res := #t~ret7;havoc #t~ret7; 14492#ackermannFINAL assume true; 14491#ackermannEXIT >#45#return; 14320#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14478#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14489#ackermannFINAL assume true; 14488#ackermannEXIT >#45#return; 14319#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14477#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14516#ackermannFINAL assume true; 14514#ackermannEXIT >#45#return; 14322#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14475#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14466#ackermannFINAL assume true; 14416#ackermannEXIT >#47#return; 14410#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14406#ackermannFINAL assume true; 14404#ackermannEXIT >#43#return; 14403#L21-1 #res := #t~ret7;havoc #t~ret7; 14402#ackermannFINAL assume true; 14395#ackermannEXIT >#45#return; 14396#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14500#ackermannENTRY ~m := #in~m;~n := #in~n; 14518#L17 assume !(0 == ~m); 14517#L20 assume !(0 == ~n); 14357#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14361#ackermannENTRY ~m := #in~m;~n := #in~n; 14362#L17 assume !(0 == ~m); 14379#L20 assume !(0 == ~n); 14356#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14361#ackermannENTRY ~m := #in~m;~n := #in~n; 14362#L17 assume !(0 == ~m); 14379#L20 assume !(0 == ~n); 14356#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14361#ackermannENTRY ~m := #in~m;~n := #in~n; 14362#L17 assume !(0 == ~m); 14379#L20 assume !(0 == ~n); 14356#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14361#ackermannENTRY ~m := #in~m;~n := #in~n; 14360#L17 assume !(0 == ~m); 14359#L20 assume 0 == ~n; 14350#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14355#ackermannENTRY ~m := #in~m;~n := #in~n; 14354#L17 assume !(0 == ~m); 14353#L20 assume !(0 == ~n); 14349#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14351#ackermannENTRY ~m := #in~m;~n := #in~n; 14451#L17 assume !(0 == ~m); 14446#L20 assume 0 == ~n; 14442#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14445#ackermannENTRY ~m := #in~m;~n := #in~n; 14456#L17 assume 0 == ~m;#res := 1 + ~n; 14447#ackermannFINAL assume true; 14441#ackermannEXIT >#43#return; 14440#L21-1 #res := #t~ret7;havoc #t~ret7; 14439#ackermannFINAL assume true; 14436#ackermannEXIT >#45#return; 14430#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14431#ackermannENTRY ~m := #in~m;~n := #in~n; 14458#L17 assume 0 == ~m;#res := 1 + ~n; 14435#ackermannFINAL assume true; 14429#ackermannEXIT >#47#return; 14427#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14425#ackermannFINAL assume true; 14422#ackermannEXIT >#43#return; 14423#L21-1 #res := #t~ret7;havoc #t~ret7; 14539#ackermannFINAL assume true; 14537#ackermannEXIT >#45#return; 14297#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14294#ackermannENTRY ~m := #in~m;~n := #in~n; 14300#L17 assume !(0 == ~m); 14490#L20 assume !(0 == ~n); 14450#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14453#L17 assume !(0 == ~m); 14452#L20 assume 0 == ~n; 14443#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14445#ackermannENTRY ~m := #in~m;~n := #in~n; 14456#L17 assume 0 == ~m;#res := 1 + ~n; 14447#ackermannFINAL assume true; 14441#ackermannEXIT >#43#return; 14444#L21-1 #res := #t~ret7;havoc #t~ret7; 14492#ackermannFINAL assume true; 14491#ackermannEXIT >#45#return; 14320#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14478#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14489#ackermannFINAL assume true; 14488#ackermannEXIT >#45#return; 14319#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14477#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14516#ackermannFINAL assume true; 14514#ackermannEXIT >#45#return; 14324#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14481#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14487#ackermannFINAL assume true; 14483#ackermannEXIT >#45#return; 14321#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14479#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14511#ackermannFINAL assume true; 14506#ackermannEXIT >#47#return; 14508#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14534#ackermannFINAL assume true; 14532#ackermannEXIT >#45#return; 14299#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14294#ackermannENTRY ~m := #in~m;~n := #in~n; 14300#L17 assume !(0 == ~m); 14490#L20 assume !(0 == ~n); 14450#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14453#L17 assume !(0 == ~m); 14452#L20 assume 0 == ~n; 14443#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14445#ackermannENTRY ~m := #in~m;~n := #in~n; 14456#L17 assume 0 == ~m;#res := 1 + ~n; 14447#ackermannFINAL assume true; 14441#ackermannEXIT >#43#return; 14444#L21-1 #res := #t~ret7;havoc #t~ret7; 14492#ackermannFINAL assume true; 14491#ackermannEXIT >#45#return; 14320#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14478#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14489#ackermannFINAL assume true; 14488#ackermannEXIT >#45#return; 14319#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14477#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14516#ackermannFINAL assume true; 14514#ackermannEXIT >#45#return; 14324#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14481#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14487#ackermannFINAL assume true; 14483#ackermannEXIT >#45#return; 14321#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14479#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14511#ackermannFINAL assume true; 14506#ackermannEXIT >#47#return; 14510#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14521#ackermannFINAL assume true; 14520#ackermannEXIT >#45#return; 14295#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14294#ackermannENTRY ~m := #in~m;~n := #in~n; 14300#L17 assume !(0 == ~m); 14490#L20 assume !(0 == ~n); 14450#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14453#L17 assume !(0 == ~m); 14452#L20 assume 0 == ~n; 14443#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14445#ackermannENTRY ~m := #in~m;~n := #in~n; 14456#L17 assume 0 == ~m;#res := 1 + ~n; 14447#ackermannFINAL assume true; 14441#ackermannEXIT >#43#return; 14444#L21-1 #res := #t~ret7;havoc #t~ret7; 14492#ackermannFINAL assume true; 14491#ackermannEXIT >#45#return; 14320#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14478#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14489#ackermannFINAL assume true; 14488#ackermannEXIT >#45#return; 14319#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14477#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14516#ackermannFINAL assume true; 14514#ackermannEXIT >#45#return; 14324#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14481#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14487#ackermannFINAL assume true; 14483#ackermannEXIT >#45#return; 14321#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14479#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14511#ackermannFINAL assume true; 14506#ackermannEXIT >#47#return; 14507#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14519#ackermannFINAL assume true; 14512#ackermannEXIT >#45#return; 14296#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14294#ackermannENTRY ~m := #in~m;~n := #in~n; 14300#L17 assume !(0 == ~m); 14490#L20 assume !(0 == ~n); 14450#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14453#L17 assume !(0 == ~m); 14452#L20 assume 0 == ~n; 14443#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14445#ackermannENTRY ~m := #in~m;~n := #in~n; 14456#L17 assume 0 == ~m;#res := 1 + ~n; 14447#ackermannFINAL assume true; 14441#ackermannEXIT >#43#return; 14444#L21-1 #res := #t~ret7;havoc #t~ret7; 14492#ackermannFINAL assume true; 14491#ackermannEXIT >#45#return; 14320#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14478#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14489#ackermannFINAL assume true; 14488#ackermannEXIT >#45#return; 14319#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14477#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14516#ackermannFINAL assume true; 14514#ackermannEXIT >#45#return; 14324#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14481#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14487#ackermannFINAL assume true; 14483#ackermannEXIT >#45#return; 14321#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14479#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14511#ackermannFINAL assume true; 14506#ackermannEXIT >#47#return; 14504#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14502#ackermannFINAL assume true; 14498#ackermannEXIT >#47#return; 14497#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14496#ackermannFINAL assume true; 14493#ackermannEXIT >#43#return; 14495#L21-1 #res := #t~ret7;havoc #t~ret7; 14546#ackermannFINAL assume true; 14313#ackermannEXIT >#45#return; 14317#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14474#ackermannENTRY ~m := #in~m;~n := #in~n; 14326#L17 assume !(0 == ~m); 14331#L20 assume !(0 == ~n); 14306#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14397#ackermannENTRY ~m := #in~m;~n := #in~n; 14412#L17 assume !(0 == ~m); 14335#L20 assume !(0 == ~n); 14308#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14397#ackermannENTRY ~m := #in~m;~n := #in~n; 14412#L17 assume !(0 == ~m); 14335#L20 assume !(0 == ~n); 14308#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14397#ackermannENTRY ~m := #in~m;~n := #in~n; 14412#L17 assume !(0 == ~m); 14335#L20 assume !(0 == ~n); 14308#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14397#ackermannENTRY ~m := #in~m;~n := #in~n; 14411#L17 assume !(0 == ~m); 14408#L20 assume 0 == ~n; 14400#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14407#ackermannENTRY ~m := #in~m;~n := #in~n; 14469#L17 assume !(0 == ~m); 14465#L20 assume !(0 == ~n); 14302#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14301#ackermannENTRY ~m := #in~m;~n := #in~n; 14303#L17 assume !(0 == ~m); 14467#L20 assume 0 == ~n; 14398#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14343#ackermannENTRY ~m := #in~m;~n := #in~n; 14470#L17 assume 0 == ~m;#res := 1 + ~n; 14447#ackermannFINAL assume true; 14441#ackermannEXIT >#43#return; 14440#L21-1 #res := #t~ret7;havoc #t~ret7; 14439#ackermannFINAL assume true; 14436#ackermannEXIT >#45#return; 14430#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14431#ackermannENTRY ~m := #in~m;~n := #in~n; 14458#L17 assume 0 == ~m;#res := 1 + ~n; 14435#ackermannFINAL assume true; 14429#ackermannEXIT >#47#return; 14427#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14425#ackermannFINAL assume true; 14422#ackermannEXIT >#43#return; 14423#L21-1 #res := #t~ret7;havoc #t~ret7; 14539#ackermannFINAL assume true; 14537#ackermannEXIT >#45#return; 14297#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14294#ackermannENTRY ~m := #in~m;~n := #in~n; 14300#L17 assume !(0 == ~m); 14490#L20 assume !(0 == ~n); 14450#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14453#L17 assume !(0 == ~m); 14452#L20 assume 0 == ~n; 14443#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14445#ackermannENTRY ~m := #in~m;~n := #in~n; 14456#L17 assume 0 == ~m;#res := 1 + ~n; 14447#ackermannFINAL assume true; 14441#ackermannEXIT >#43#return; 14444#L21-1 #res := #t~ret7;havoc #t~ret7; 14492#ackermannFINAL assume true; 14491#ackermannEXIT >#45#return; 14320#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14478#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14489#ackermannFINAL assume true; 14488#ackermannEXIT >#45#return; 14319#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14477#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14516#ackermannFINAL assume true; 14514#ackermannEXIT >#45#return; 14324#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14481#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14487#ackermannFINAL assume true; 14483#ackermannEXIT >#45#return; 14321#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14479#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14511#ackermannFINAL assume true; 14506#ackermannEXIT >#47#return; 14508#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14534#ackermannFINAL assume true; 14532#ackermannEXIT >#45#return; 14299#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14294#ackermannENTRY ~m := #in~m;~n := #in~n; 14300#L17 assume !(0 == ~m); 14490#L20 assume !(0 == ~n); 14450#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14453#L17 assume !(0 == ~m); 14452#L20 assume 0 == ~n; 14443#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14445#ackermannENTRY ~m := #in~m;~n := #in~n; 14456#L17 assume 0 == ~m;#res := 1 + ~n; 14447#ackermannFINAL assume true; 14441#ackermannEXIT >#43#return; 14444#L21-1 #res := #t~ret7;havoc #t~ret7; 14492#ackermannFINAL assume true; 14491#ackermannEXIT >#45#return; 14320#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14478#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14489#ackermannFINAL assume true; 14488#ackermannEXIT >#45#return; 14319#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14477#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14516#ackermannFINAL assume true; 14514#ackermannEXIT >#45#return; 14324#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14481#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14487#ackermannFINAL assume true; 14483#ackermannEXIT >#45#return; 14321#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14479#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14511#ackermannFINAL assume true; 14506#ackermannEXIT >#47#return; 14510#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14521#ackermannFINAL assume true; 14520#ackermannEXIT >#45#return; 14295#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14294#ackermannENTRY ~m := #in~m;~n := #in~n; 14300#L17 assume !(0 == ~m); 14490#L20 assume !(0 == ~n); 14450#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14453#L17 assume !(0 == ~m); 14452#L20 assume 0 == ~n; 14443#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14445#ackermannENTRY ~m := #in~m;~n := #in~n; 14456#L17 assume 0 == ~m;#res := 1 + ~n; 14447#ackermannFINAL assume true; 14441#ackermannEXIT >#43#return; 14444#L21-1 #res := #t~ret7;havoc #t~ret7; 14492#ackermannFINAL assume true; 14491#ackermannEXIT >#45#return; 14320#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14478#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14489#ackermannFINAL assume true; 14488#ackermannEXIT >#45#return; 14319#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14477#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14516#ackermannFINAL assume true; 14514#ackermannEXIT >#45#return; 14324#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14481#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14487#ackermannFINAL assume true; 14483#ackermannEXIT >#45#return; 14321#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14479#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14511#ackermannFINAL assume true; 14506#ackermannEXIT >#47#return; 14507#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14519#ackermannFINAL assume true; 14512#ackermannEXIT >#45#return; 14298#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14294#ackermannENTRY ~m := #in~m;~n := #in~n; 14300#L17 assume !(0 == ~m); 14490#L20 assume !(0 == ~n); 14450#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14453#L17 assume !(0 == ~m); 14452#L20 assume 0 == ~n; 14443#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14445#ackermannENTRY ~m := #in~m;~n := #in~n; 14456#L17 assume 0 == ~m;#res := 1 + ~n; 14447#ackermannFINAL assume true; 14441#ackermannEXIT >#43#return; 14444#L21-1 #res := #t~ret7;havoc #t~ret7; 14492#ackermannFINAL assume true; 14491#ackermannEXIT >#45#return; 14320#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14478#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14489#ackermannFINAL assume true; 14488#ackermannEXIT >#45#return; 14319#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14477#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14516#ackermannFINAL assume true; 14514#ackermannEXIT >#45#return; 14324#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14481#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14487#ackermannFINAL assume true; 14483#ackermannEXIT >#45#return; 14321#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14479#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14511#ackermannFINAL assume true; 14506#ackermannEXIT >#47#return; 14509#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14541#ackermannFINAL assume true; 14524#ackermannEXIT >#47#return; 14525#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14551#ackermannFINAL assume true; 14550#ackermannEXIT >#45#return; 14337#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14380#ackermannENTRY ~m := #in~m;~n := #in~n; 14381#L17 assume !(0 == ~m); 14535#L20 assume !(0 == ~n); 14358#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14361#ackermannENTRY ~m := #in~m;~n := #in~n; 14362#L17 assume !(0 == ~m); 14379#L20 assume !(0 == ~n); 14356#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14361#ackermannENTRY ~m := #in~m;~n := #in~n; 14362#L17 assume !(0 == ~m); 14379#L20 assume !(0 == ~n); 14356#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14361#ackermannENTRY ~m := #in~m;~n := #in~n; 14362#L17 assume !(0 == ~m); 14379#L20 assume !(0 == ~n); 14356#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14361#ackermannENTRY ~m := #in~m;~n := #in~n; 14360#L17 assume !(0 == ~m); 14359#L20 assume 0 == ~n; 14350#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14355#ackermannENTRY ~m := #in~m;~n := #in~n; 14354#L17 assume !(0 == ~m); 14353#L20 assume !(0 == ~n); 14349#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14351#ackermannENTRY ~m := #in~m;~n := #in~n; 14451#L17 assume !(0 == ~m); 14446#L20 assume 0 == ~n; 14442#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14445#ackermannENTRY ~m := #in~m;~n := #in~n; 14456#L17 assume 0 == ~m;#res := 1 + ~n; 14447#ackermannFINAL assume true; 14441#ackermannEXIT >#43#return; 14440#L21-1 #res := #t~ret7;havoc #t~ret7; 14439#ackermannFINAL assume true; 14436#ackermannEXIT >#45#return; 14430#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14431#ackermannENTRY ~m := #in~m;~n := #in~n; 14458#L17 assume 0 == ~m;#res := 1 + ~n; 14435#ackermannFINAL assume true; 14429#ackermannEXIT >#47#return; 14427#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14425#ackermannFINAL assume true; 14422#ackermannEXIT >#43#return; 14423#L21-1 #res := #t~ret7;havoc #t~ret7; 14539#ackermannFINAL assume true; 14537#ackermannEXIT >#45#return; 14297#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14294#ackermannENTRY ~m := #in~m;~n := #in~n; 14300#L17 assume !(0 == ~m); 14490#L20 assume !(0 == ~n); 14450#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14453#L17 assume !(0 == ~m); 14452#L20 assume 0 == ~n; 14443#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14445#ackermannENTRY ~m := #in~m;~n := #in~n; 14456#L17 assume 0 == ~m;#res := 1 + ~n; 14447#ackermannFINAL assume true; 14441#ackermannEXIT >#43#return; 14444#L21-1 #res := #t~ret7;havoc #t~ret7; 14492#ackermannFINAL assume true; 14491#ackermannEXIT >#45#return; 14320#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14478#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14489#ackermannFINAL assume true; 14488#ackermannEXIT >#45#return; 14319#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14477#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14516#ackermannFINAL assume true; 14514#ackermannEXIT >#45#return; 14324#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14481#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14487#ackermannFINAL assume true; 14483#ackermannEXIT >#45#return; 14321#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14479#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14511#ackermannFINAL assume true; 14506#ackermannEXIT >#47#return; 14508#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14534#ackermannFINAL assume true; 14532#ackermannEXIT >#45#return; 14299#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14294#ackermannENTRY ~m := #in~m;~n := #in~n; 14300#L17 assume !(0 == ~m); 14490#L20 assume !(0 == ~n); 14450#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14453#L17 assume !(0 == ~m); 14452#L20 assume 0 == ~n; 14443#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14445#ackermannENTRY ~m := #in~m;~n := #in~n; 14456#L17 assume 0 == ~m;#res := 1 + ~n; 14447#ackermannFINAL assume true; 14441#ackermannEXIT >#43#return; 14444#L21-1 #res := #t~ret7;havoc #t~ret7; 14492#ackermannFINAL assume true; 14491#ackermannEXIT >#45#return; 14320#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14478#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14489#ackermannFINAL assume true; 14488#ackermannEXIT >#45#return; 14319#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14477#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14516#ackermannFINAL assume true; 14514#ackermannEXIT >#45#return; 14324#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14481#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14487#ackermannFINAL assume true; 14483#ackermannEXIT >#45#return; 14321#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14479#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14511#ackermannFINAL assume true; 14506#ackermannEXIT >#47#return; 14510#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14521#ackermannFINAL assume true; 14520#ackermannEXIT >#45#return; 14295#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14294#ackermannENTRY ~m := #in~m;~n := #in~n; 14300#L17 assume !(0 == ~m); 14490#L20 assume !(0 == ~n); 14450#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14453#L17 assume !(0 == ~m); 14452#L20 assume 0 == ~n; 14443#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14445#ackermannENTRY ~m := #in~m;~n := #in~n; 14456#L17 assume 0 == ~m;#res := 1 + ~n; 14447#ackermannFINAL assume true; 14441#ackermannEXIT >#43#return; 14444#L21-1 #res := #t~ret7;havoc #t~ret7; 14492#ackermannFINAL assume true; 14491#ackermannEXIT >#45#return; 14320#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14478#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14489#ackermannFINAL assume true; 14488#ackermannEXIT >#45#return; 14319#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14477#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14516#ackermannFINAL assume true; 14514#ackermannEXIT >#45#return; 14324#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14481#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14487#ackermannFINAL assume true; 14483#ackermannEXIT >#45#return; 14321#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14479#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14511#ackermannFINAL assume true; 14506#ackermannEXIT >#47#return; 14507#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14519#ackermannFINAL assume true; 14512#ackermannEXIT >#45#return; 14298#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14294#ackermannENTRY ~m := #in~m;~n := #in~n; 14300#L17 assume !(0 == ~m); 14490#L20 assume !(0 == ~n); 14450#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14453#L17 assume !(0 == ~m); 14452#L20 assume 0 == ~n; 14443#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14445#ackermannENTRY ~m := #in~m;~n := #in~n; 14456#L17 assume 0 == ~m;#res := 1 + ~n; 14447#ackermannFINAL assume true; 14441#ackermannEXIT >#43#return; 14444#L21-1 #res := #t~ret7;havoc #t~ret7; 14492#ackermannFINAL assume true; 14491#ackermannEXIT >#45#return; 14320#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14478#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14489#ackermannFINAL assume true; 14488#ackermannEXIT >#45#return; 14319#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14477#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14516#ackermannFINAL assume true; 14514#ackermannEXIT >#45#return; 14324#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14481#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14487#ackermannFINAL assume true; 14483#ackermannEXIT >#45#return; 14321#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14479#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14511#ackermannFINAL assume true; 14506#ackermannEXIT >#47#return; 14509#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14541#ackermannFINAL assume true; 14524#ackermannEXIT >#47#return; 14528#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14549#ackermannFINAL assume true; 14548#ackermannEXIT >#45#return; 14336#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14380#ackermannENTRY ~m := #in~m;~n := #in~n; 14381#L17 assume !(0 == ~m); 14535#L20 assume !(0 == ~n); 14358#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14361#ackermannENTRY ~m := #in~m;~n := #in~n; 14362#L17 assume !(0 == ~m); 14379#L20 assume !(0 == ~n); 14356#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14361#ackermannENTRY ~m := #in~m;~n := #in~n; 14362#L17 assume !(0 == ~m); 14379#L20 assume !(0 == ~n); 14356#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14361#ackermannENTRY ~m := #in~m;~n := #in~n; 14362#L17 assume !(0 == ~m); 14379#L20 assume !(0 == ~n); 14356#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14361#ackermannENTRY ~m := #in~m;~n := #in~n; 14360#L17 assume !(0 == ~m); 14359#L20 assume 0 == ~n; 14350#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14355#ackermannENTRY ~m := #in~m;~n := #in~n; 14354#L17 assume !(0 == ~m); 14353#L20 assume !(0 == ~n); 14349#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14351#ackermannENTRY ~m := #in~m;~n := #in~n; 14451#L17 assume !(0 == ~m); 14446#L20 assume 0 == ~n; 14442#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14445#ackermannENTRY ~m := #in~m;~n := #in~n; 14456#L17 assume 0 == ~m;#res := 1 + ~n; 14447#ackermannFINAL assume true; 14441#ackermannEXIT >#43#return; 14440#L21-1 #res := #t~ret7;havoc #t~ret7; 14439#ackermannFINAL assume true; 14436#ackermannEXIT >#45#return; 14430#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14431#ackermannENTRY ~m := #in~m;~n := #in~n; 14458#L17 assume 0 == ~m;#res := 1 + ~n; 14435#ackermannFINAL assume true; 14429#ackermannEXIT >#47#return; 14427#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14425#ackermannFINAL assume true; 14422#ackermannEXIT >#43#return; 14423#L21-1 #res := #t~ret7;havoc #t~ret7; 14539#ackermannFINAL assume true; 14537#ackermannEXIT >#45#return; 14297#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14294#ackermannENTRY ~m := #in~m;~n := #in~n; 14300#L17 assume !(0 == ~m); 14490#L20 assume !(0 == ~n); 14450#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14453#L17 assume !(0 == ~m); 14452#L20 assume 0 == ~n; 14443#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14445#ackermannENTRY ~m := #in~m;~n := #in~n; 14456#L17 assume 0 == ~m;#res := 1 + ~n; 14447#ackermannFINAL assume true; 14441#ackermannEXIT >#43#return; 14444#L21-1 #res := #t~ret7;havoc #t~ret7; 14492#ackermannFINAL assume true; 14491#ackermannEXIT >#45#return; 14320#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14478#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14489#ackermannFINAL assume true; 14488#ackermannEXIT >#45#return; 14319#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14477#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14516#ackermannFINAL assume true; 14514#ackermannEXIT >#45#return; 14324#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14481#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14487#ackermannFINAL assume true; 14483#ackermannEXIT >#45#return; 14321#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14479#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14511#ackermannFINAL assume true; 14506#ackermannEXIT >#47#return; 14508#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14534#ackermannFINAL assume true; 14532#ackermannEXIT >#45#return; 14299#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14294#ackermannENTRY ~m := #in~m;~n := #in~n; 14300#L17 assume !(0 == ~m); 14490#L20 assume !(0 == ~n); 14450#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14453#L17 assume !(0 == ~m); 14452#L20 assume 0 == ~n; 14443#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14445#ackermannENTRY ~m := #in~m;~n := #in~n; 14456#L17 assume 0 == ~m;#res := 1 + ~n; 14447#ackermannFINAL assume true; 14441#ackermannEXIT >#43#return; 14444#L21-1 #res := #t~ret7;havoc #t~ret7; 14492#ackermannFINAL assume true; 14491#ackermannEXIT >#45#return; 14320#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14478#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14489#ackermannFINAL assume true; 14488#ackermannEXIT >#45#return; 14319#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14477#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14516#ackermannFINAL assume true; 14514#ackermannEXIT >#45#return; 14324#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14481#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14487#ackermannFINAL assume true; 14483#ackermannEXIT >#45#return; 14321#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14479#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14511#ackermannFINAL assume true; 14506#ackermannEXIT >#47#return; 14510#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14521#ackermannFINAL assume true; 14520#ackermannEXIT >#45#return; 14295#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14294#ackermannENTRY ~m := #in~m;~n := #in~n; 14300#L17 assume !(0 == ~m); 14490#L20 assume !(0 == ~n); 14450#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14453#L17 assume !(0 == ~m); 14452#L20 assume 0 == ~n; 14443#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14445#ackermannENTRY ~m := #in~m;~n := #in~n; 14456#L17 assume 0 == ~m;#res := 1 + ~n; 14447#ackermannFINAL assume true; 14441#ackermannEXIT >#43#return; 14444#L21-1 #res := #t~ret7;havoc #t~ret7; 14492#ackermannFINAL assume true; 14491#ackermannEXIT >#45#return; 14320#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14478#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14489#ackermannFINAL assume true; 14488#ackermannEXIT >#45#return; 14319#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14477#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14516#ackermannFINAL assume true; 14514#ackermannEXIT >#45#return; 14324#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14481#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14487#ackermannFINAL assume true; 14483#ackermannEXIT >#45#return; 14321#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14479#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14511#ackermannFINAL assume true; 14506#ackermannEXIT >#47#return; 14507#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14519#ackermannFINAL assume true; 14512#ackermannEXIT >#45#return; 14298#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14294#ackermannENTRY ~m := #in~m;~n := #in~n; 14300#L17 assume !(0 == ~m); 14490#L20 assume !(0 == ~n); 14450#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14453#L17 assume !(0 == ~m); 14452#L20 assume 0 == ~n; 14443#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14445#ackermannENTRY ~m := #in~m;~n := #in~n; 14456#L17 assume 0 == ~m;#res := 1 + ~n; 14447#ackermannFINAL assume true; 14441#ackermannEXIT >#43#return; 14444#L21-1 #res := #t~ret7;havoc #t~ret7; 14492#ackermannFINAL assume true; 14491#ackermannEXIT >#45#return; 14320#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14478#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14489#ackermannFINAL assume true; 14488#ackermannEXIT >#45#return; 14319#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14477#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14516#ackermannFINAL assume true; 14514#ackermannEXIT >#45#return; 14324#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14481#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14487#ackermannFINAL assume true; 14483#ackermannEXIT >#45#return; 14321#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14479#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14511#ackermannFINAL assume true; 14506#ackermannEXIT >#47#return; 14509#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14541#ackermannFINAL assume true; 14524#ackermannEXIT >#47#return; 14526#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14542#ackermannFINAL assume true; 14533#ackermannEXIT >#45#return; 14338#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14380#ackermannENTRY ~m := #in~m;~n := #in~n; 14381#L17 assume !(0 == ~m); 14535#L20 assume !(0 == ~n); 14358#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14361#ackermannENTRY ~m := #in~m;~n := #in~n; 14362#L17 assume !(0 == ~m); 14379#L20 assume !(0 == ~n); 14356#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14361#ackermannENTRY ~m := #in~m;~n := #in~n; 14362#L17 assume !(0 == ~m); 14379#L20 assume !(0 == ~n); 14356#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14361#ackermannENTRY ~m := #in~m;~n := #in~n; 14362#L17 assume !(0 == ~m); 14379#L20 assume !(0 == ~n); 14356#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14361#ackermannENTRY ~m := #in~m;~n := #in~n; 14360#L17 assume !(0 == ~m); 14359#L20 assume 0 == ~n; 14350#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14355#ackermannENTRY ~m := #in~m;~n := #in~n; 14354#L17 assume !(0 == ~m); 14353#L20 assume !(0 == ~n); 14349#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14351#ackermannENTRY ~m := #in~m;~n := #in~n; 14451#L17 assume !(0 == ~m); 14446#L20 assume 0 == ~n; 14442#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14445#ackermannENTRY ~m := #in~m;~n := #in~n; 14456#L17 assume 0 == ~m;#res := 1 + ~n; 14447#ackermannFINAL assume true; 14441#ackermannEXIT >#43#return; 14440#L21-1 #res := #t~ret7;havoc #t~ret7; 14439#ackermannFINAL assume true; 14436#ackermannEXIT >#45#return; 14430#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14431#ackermannENTRY ~m := #in~m;~n := #in~n; 14458#L17 assume 0 == ~m;#res := 1 + ~n; 14435#ackermannFINAL assume true; 14429#ackermannEXIT >#47#return; 14427#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14425#ackermannFINAL assume true; 14422#ackermannEXIT >#43#return; 14423#L21-1 #res := #t~ret7;havoc #t~ret7; 14539#ackermannFINAL assume true; 14537#ackermannEXIT >#45#return; 14297#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14294#ackermannENTRY ~m := #in~m;~n := #in~n; 14300#L17 assume !(0 == ~m); 14490#L20 assume !(0 == ~n); 14450#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14453#L17 assume !(0 == ~m); 14452#L20 assume 0 == ~n; 14443#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14445#ackermannENTRY ~m := #in~m;~n := #in~n; 14456#L17 assume 0 == ~m;#res := 1 + ~n; 14447#ackermannFINAL assume true; 14441#ackermannEXIT >#43#return; 14444#L21-1 #res := #t~ret7;havoc #t~ret7; 14492#ackermannFINAL assume true; 14491#ackermannEXIT >#45#return; 14320#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14478#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14489#ackermannFINAL assume true; 14488#ackermannEXIT >#45#return; 14319#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14477#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14516#ackermannFINAL assume true; 14514#ackermannEXIT >#45#return; 14324#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14481#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14487#ackermannFINAL assume true; 14483#ackermannEXIT >#45#return; 14321#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14479#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14511#ackermannFINAL assume true; 14506#ackermannEXIT >#47#return; 14508#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14534#ackermannFINAL assume true; 14532#ackermannEXIT >#45#return; 14299#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14294#ackermannENTRY ~m := #in~m;~n := #in~n; 14300#L17 assume !(0 == ~m); 14490#L20 assume !(0 == ~n); 14450#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14453#L17 assume !(0 == ~m); 14452#L20 assume 0 == ~n; 14443#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14445#ackermannENTRY ~m := #in~m;~n := #in~n; 14456#L17 assume 0 == ~m;#res := 1 + ~n; 14447#ackermannFINAL assume true; 14441#ackermannEXIT >#43#return; 14444#L21-1 #res := #t~ret7;havoc #t~ret7; 14492#ackermannFINAL assume true; 14491#ackermannEXIT >#45#return; 14320#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14478#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14489#ackermannFINAL assume true; 14488#ackermannEXIT >#45#return; 14319#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14477#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14516#ackermannFINAL assume true; 14514#ackermannEXIT >#45#return; 14324#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14481#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14487#ackermannFINAL assume true; 14483#ackermannEXIT >#45#return; 14321#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14479#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14511#ackermannFINAL assume true; 14506#ackermannEXIT >#47#return; 14510#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14521#ackermannFINAL assume true; 14520#ackermannEXIT >#45#return; 14295#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14294#ackermannENTRY ~m := #in~m;~n := #in~n; 14300#L17 assume !(0 == ~m); 14490#L20 assume !(0 == ~n); 14450#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14453#L17 assume !(0 == ~m); 14452#L20 assume 0 == ~n; 14443#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14445#ackermannENTRY ~m := #in~m;~n := #in~n; 14456#L17 assume 0 == ~m;#res := 1 + ~n; 14447#ackermannFINAL assume true; 14441#ackermannEXIT >#43#return; 14444#L21-1 #res := #t~ret7;havoc #t~ret7; 14492#ackermannFINAL assume true; 14491#ackermannEXIT >#45#return; 14320#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14478#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14489#ackermannFINAL assume true; 14488#ackermannEXIT >#45#return; 14319#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14477#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14516#ackermannFINAL assume true; 14514#ackermannEXIT >#45#return; 14324#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14481#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14487#ackermannFINAL assume true; 14483#ackermannEXIT >#45#return; 14321#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14479#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14511#ackermannFINAL assume true; 14506#ackermannEXIT >#47#return; 14507#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14519#ackermannFINAL assume true; 14512#ackermannEXIT >#45#return; 14298#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14294#ackermannENTRY ~m := #in~m;~n := #in~n; 14300#L17 assume !(0 == ~m); 14490#L20 assume !(0 == ~n); 14450#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14455#L17 assume !(0 == ~m); 14486#L20 assume !(0 == ~n); 14449#L23 call #t~ret8 := ackermann(~m, ~n - 1);< 14454#ackermannENTRY ~m := #in~m;~n := #in~n; 14453#L17 assume !(0 == ~m); 14452#L20 assume 0 == ~n; 14443#L21 call #t~ret7 := ackermann(~m - 1, 1);< 14445#ackermannENTRY ~m := #in~m;~n := #in~n; 14456#L17 assume 0 == ~m;#res := 1 + ~n; 14447#ackermannFINAL assume true; 14441#ackermannEXIT >#43#return; 14444#L21-1 #res := #t~ret7;havoc #t~ret7; 14492#ackermannFINAL assume true; 14491#ackermannEXIT >#45#return; 14320#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14478#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14489#ackermannFINAL assume true; 14488#ackermannEXIT >#45#return; 14319#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14477#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14516#ackermannFINAL assume true; 14514#ackermannEXIT >#45#return; 14324#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14481#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14487#ackermannFINAL assume true; 14483#ackermannEXIT >#45#return; 14321#L23-1 call #t~ret9 := ackermann(~m - 1, #t~ret8);< 14482#ackermannENTRY ~m := #in~m;~n := #in~n; 14318#L17 assume 0 == ~m;#res := 1 + ~n; 14325#ackermannFINAL assume true; 14476#ackermannEXIT >#47#return; 14479#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14511#ackermannFINAL assume true; 14506#ackermannEXIT >#47#return; 14509#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14541#ackermannFINAL assume true; 14524#ackermannEXIT >#47#return; 14527#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14540#ackermannFINAL assume true; 14529#ackermannEXIT >#47#return; 14530#L23-2 #res := #t~ret9;havoc #t~ret8;havoc #t~ret9; 14547#ackermannFINAL assume true; 14545#ackermannEXIT >#45#return; 14316#L23-1 [2021-08-27 16:28:09,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:28:09,126 INFO L82 PathProgramCache]: Analyzing trace with hash -358725784, now seen corresponding path program 8 times [2021-08-27 16:28:09,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:28:09,126 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822244976] [2021-08-27 16:28:09,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:28:09,127 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:28:09,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:09,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-08-27 16:28:09,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:09,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:09,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:09,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:09,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:09,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:09,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:09,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:09,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:09,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:09,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:09,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:09,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:09,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:09,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:09,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:09,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 16:28:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:09,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:09,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:09,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:09,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:09,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:09,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:09,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:09,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:09,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 16:28:10,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-08-27 16:28:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-08-27 16:28:10,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:10,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:10,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:10,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:10,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:10,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:10,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:10,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 16:28:10,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:10,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:10,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:10,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:10,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 16:28:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-08-27 16:28:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-08-27 16:28:10,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-08-27 16:28:10,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:10,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:10,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:10,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:10,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 16:28:10,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-08-27 16:28:10,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-08-27 16:28:10,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2021-08-27 16:28:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:10,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:10,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:10,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:10,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:10,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 16:28:10,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-08-27 16:28:10,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-08-27 16:28:10,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2021-08-27 16:28:10,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:10,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:10,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:10,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:10,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:10,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 16:28:10,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-08-27 16:28:10,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-08-27 16:28:10,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:10,547 INFO L134 CoverageAnalysis]: Checked inductivity of 10643 backedges. 1002 proven. 2417 refuted. 0 times theorem prover too weak. 7224 trivial. 0 not checked. [2021-08-27 16:28:10,548 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:28:10,548 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822244976] [2021-08-27 16:28:10,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822244976] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 16:28:10,548 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116263178] [2021-08-27 16:28:10,548 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 16:28:10,549 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 16:28:10,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:28:10,553 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) [2021-08-27 16:28:10,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (164)] Waiting until timeout for monitored process [2021-08-27 16:28:11,522 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 16:28:11,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 16:28:11,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 1184 conjuncts, 20 conjunts are in the unsatisfiable core [2021-08-27 16:28:11,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:28:12,566 INFO L134 CoverageAnalysis]: Checked inductivity of 10643 backedges. 372 proven. 1768 refuted. 0 times theorem prover too weak. 8503 trivial. 0 not checked. [2021-08-27 16:28:12,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116263178] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 16:28:12,566 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 16:28:12,566 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 10] total 34 [2021-08-27 16:28:12,566 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574472182] [2021-08-27 16:28:12,567 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:28:12,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:28:12,568 INFO L82 PathProgramCache]: Analyzing trace with hash 853391365, now seen corresponding path program 6 times [2021-08-27 16:28:12,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:28:12,568 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108160680] [2021-08-27 16:28:12,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:28:12,568 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:28:12,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:14,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 16:28:14,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:15,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:15,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:15,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:15,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:15,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:15,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:15,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:15,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:15,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:15,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:15,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:15,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:15,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:15,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:15,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:15,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 16:28:15,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:16,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:16,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:16,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 16:28:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-08-27 16:28:16,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-08-27 16:28:16,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:16,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:16,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:16,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:16,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:16,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:16,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 16:28:16,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:16,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:16,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:16,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:16,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:16,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 16:28:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-08-27 16:28:16,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-08-27 16:28:16,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-08-27 16:28:16,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:16,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:16,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:16,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:16,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 16:28:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-08-27 16:28:16,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-08-27 16:28:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2021-08-27 16:28:16,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:16,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:16,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:16,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 16:28:16,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-08-27 16:28:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-08-27 16:28:16,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2021-08-27 16:28:16,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:16,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:16,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:16,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:16,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:16,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 16:28:16,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-08-27 16:28:16,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-08-27 16:28:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:16,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 409 [2021-08-27 16:28:16,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:17,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:17,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:17,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:17,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:18,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 16:28:18,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 16:28:18,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-08-27 16:28:18,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-08-27 16:28:18,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:18,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 16:28:18,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:18,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 16:28:18,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-08-27 16:28:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-08-27 16:28:18,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-08-27 16:28:18,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:18,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 16:28:18,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-08-27 16:28:18,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-08-27 16:28:18,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2021-08-27 16:28:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:18,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 16:28:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-08-27 16:28:18,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-08-27 16:28:18,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2021-08-27 16:28:18,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:18,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 16:28:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-08-27 16:28:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-08-27 16:28:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 409 [2021-08-27 16:28:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:18,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 16:28:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:18,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 16:28:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-08-27 16:28:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-08-27 16:28:18,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-08-27 16:28:18,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:18,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 16:28:18,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-08-27 16:28:18,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-08-27 16:28:18,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2021-08-27 16:28:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:18,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:18,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:18,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 16:28:19,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-08-27 16:28:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-08-27 16:28:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2021-08-27 16:28:19,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:19,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 16:28:19,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-08-27 16:28:19,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-08-27 16:28:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 715 [2021-08-27 16:28:19,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:19,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 16:28:19,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 16:28:19,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-08-27 16:28:19,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-08-27 16:28:19,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-08-27 16:28:19,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:19,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 16:28:19,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-08-27 16:28:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-08-27 16:28:19,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2021-08-27 16:28:19,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:19,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 16:28:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-08-27 16:28:19,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-08-27 16:28:19,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2021-08-27 16:28:19,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:19,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 16:28:19,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-08-27 16:28:19,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-08-27 16:28:19,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1021 [2021-08-27 16:28:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:19,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 16:28:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:19,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 16:28:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-08-27 16:28:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-08-27 16:28:19,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-08-27 16:28:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:19,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 16:28:19,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-08-27 16:28:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-08-27 16:28:19,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2021-08-27 16:28:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:19,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 16:28:19,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-08-27 16:28:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-08-27 16:28:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2021-08-27 16:28:19,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:19,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 16:28:19,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-08-27 16:28:19,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-08-27 16:28:19,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1327 [2021-08-27 16:28:19,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:19,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 16:28:19,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:19,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 16:28:19,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-08-27 16:28:19,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-08-27 16:28:19,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-08-27 16:28:19,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:19,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 16:28:19,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-08-27 16:28:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-08-27 16:28:19,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2021-08-27 16:28:19,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:19,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 16:28:19,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-08-27 16:28:19,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-08-27 16:28:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2021-08-27 16:28:19,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:19,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:19,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:20,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:20,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:20,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:20,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:20,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 16:28:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:20,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 16:28:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:20,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 16:28:20,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:20,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-08-27 16:28:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:20,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-08-27 16:28:20,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:28:20,066 INFO L134 CoverageAnalysis]: Checked inductivity of 272548 backedges. 1923 proven. 16966 refuted. 0 times theorem prover too weak. 253659 trivial. 0 not checked. [2021-08-27 16:28:20,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:28:20,066 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108160680] [2021-08-27 16:28:20,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108160680] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 16:28:20,067 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22180157] [2021-08-27 16:28:20,067 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-27 16:28:20,067 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 16:28:20,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:28:20,068 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) [2021-08-27 16:28:20,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (165)] Waiting until timeout for monitored process [2021-08-27 16:28:21,340 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 32 check-sat command(s) [2021-08-27 16:28:21,340 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 16:28:21,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 708 conjuncts, 43 conjunts are in the unsatisfiable core [2021-08-27 16:28:21,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:28:25,774 INFO L134 CoverageAnalysis]: Checked inductivity of 272548 backedges. 65003 proven. 423 refuted. 0 times theorem prover too weak. 207122 trivial. 0 not checked. [2021-08-27 16:28:25,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22180157] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 16:28:25,775 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 16:28:25,775 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 29 [2021-08-27 16:28:25,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074594463] [2021-08-27 16:28:25,777 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:28:25,778 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:28:25,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-27 16:28:25,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1013, Unknown=0, NotChecked=0, Total=1122 [2021-08-27 16:28:25,779 INFO L87 Difference]: Start difference. First operand 260 states and 343 transitions. cyclomatic complexity: 89 Second operand has 34 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 24 states have internal predecessors, (65), 18 states have call successors, (21), 2 states have call predecessors, (21), 18 states have return successors, (35), 20 states have call predecessors, (35), 17 states have call successors, (35) [2021-08-27 16:28:28,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:28:28,769 INFO L93 Difference]: Finished difference Result 205 states and 241 transitions. [2021-08-27 16:28:28,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-08-27 16:28:28,770 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 205 states and 241 transitions. [2021-08-27 16:28:28,772 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-27 16:28:28,772 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 205 states to 0 states and 0 transitions. [2021-08-27 16:28:28,772 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-08-27 16:28:28,772 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-08-27 16:28:28,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-08-27 16:28:28,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:28:28,773 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 16:28:28,773 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 16:28:28,773 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 16:28:28,773 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2021-08-27 16:28:28,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-08-27 16:28:28,773 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-27 16:28:28,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-08-27 16:28:28,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.08 04:28:28 BoogieIcfgContainer [2021-08-27 16:28:28,779 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-08-27 16:28:28,780 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 16:28:28,780 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 16:28:28,780 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 16:28:28,781 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:27:24" (3/4) ... [2021-08-27 16:28:28,783 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 16:28:28,783 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 16:28:28,785 INFO L168 Benchmark]: Toolchain (without parser) took 64484.07 ms. Allocated memory was 52.4 MB in the beginning and 968.9 MB in the end (delta: 916.5 MB). Free memory was 29.1 MB in the beginning and 480.4 MB in the end (delta: -451.3 MB). Peak memory consumption was 463.3 MB. Max. memory is 16.1 GB. [2021-08-27 16:28:28,785 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 52.4 MB. Free memory was 34.3 MB in the beginning and 34.2 MB in the end (delta: 71.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 16:28:28,786 INFO L168 Benchmark]: CACSL2BoogieTranslator took 196.62 ms. Allocated memory is still 52.4 MB. Free memory was 28.9 MB in the beginning and 33.3 MB in the end (delta: -4.4 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.1 GB. [2021-08-27 16:28:28,786 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.27 ms. Allocated memory was 52.4 MB in the beginning and 62.9 MB in the end (delta: 10.5 MB). Free memory was 33.3 MB in the beginning and 46.5 MB in the end (delta: -13.1 MB). Peak memory consumption was 6.4 MB. Max. memory is 16.1 GB. [2021-08-27 16:28:28,786 INFO L168 Benchmark]: Boogie Preprocessor took 47.21 ms. Allocated memory is still 62.9 MB. Free memory was 46.5 MB in the beginning and 45.5 MB in the end (delta: 1.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 16:28:28,787 INFO L168 Benchmark]: RCFGBuilder took 364.87 ms. Allocated memory is still 62.9 MB. Free memory was 45.5 MB in the beginning and 32.7 MB in the end (delta: 12.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-08-27 16:28:28,787 INFO L168 Benchmark]: BuchiAutomizer took 63837.30 ms. Allocated memory was 62.9 MB in the beginning and 968.9 MB in the end (delta: 906.0 MB). Free memory was 32.7 MB in the beginning and 480.4 MB in the end (delta: -447.8 MB). Peak memory consumption was 460.2 MB. Max. memory is 16.1 GB. [2021-08-27 16:28:28,787 INFO L168 Benchmark]: Witness Printer took 3.46 ms. Allocated memory is still 968.9 MB. Free memory is still 480.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 16:28:28,789 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.10 ms. Allocated memory is still 52.4 MB. Free memory was 34.3 MB in the beginning and 34.2 MB in the end (delta: 71.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 196.62 ms. Allocated memory is still 52.4 MB. Free memory was 28.9 MB in the beginning and 33.3 MB in the end (delta: -4.4 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 29.27 ms. Allocated memory was 52.4 MB in the beginning and 62.9 MB in the end (delta: 10.5 MB). Free memory was 33.3 MB in the beginning and 46.5 MB in the end (delta: -13.1 MB). Peak memory consumption was 6.4 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 47.21 ms. Allocated memory is still 62.9 MB. Free memory was 46.5 MB in the beginning and 45.5 MB in the end (delta: 1.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 364.87 ms. Allocated memory is still 62.9 MB. Free memory was 45.5 MB in the beginning and 32.7 MB in the end (delta: 12.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 63837.30 ms. Allocated memory was 62.9 MB in the beginning and 968.9 MB in the end (delta: 906.0 MB). Free memory was 32.7 MB in the beginning and 480.4 MB in the end (delta: -447.8 MB). Peak memory consumption was 460.2 MB. Max. memory is 16.1 GB. * Witness Printer took 3.46 ms. Allocated memory is still 968.9 MB. Free memory is still 480.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 16 terminating modules (10 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. 10 modules have a trivial ranking function, the largest among these consists of 35 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 63.7s and 16 iterations. TraceHistogramMax:334. Analysis of lassos took 47.4s. Construction of modules took 2.8s. Büchi inclusion checks took 13.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 15. Automata minimization 140.0ms AutomataMinimizationTime, 15 MinimizatonAttempts, 199 StatesRemovedByMinimization, 14 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 260 states and ocurred in iteration 14. Nontrivial modules had stage [1, 3, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 7/12 HoareTripleCheckerStatistics: 414 SDtfs, 728 SDslu, 1171 SDs, 0 SdLazy, 4358 SolverSat, 1797 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2886.7ms Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT1 conc0 concLT1 SILN2 SILU0 SILI4 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital56 mio100 ax100 hnf99 lsp62 ukn84 mio100 lsp87 div100 bol100 ite100 ukn100 eq195 hnf93 smp95 dnf149 smp100 tf104 neg95 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 50ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 41 LassoNonterminationAnalysisSatUnbounded: 6 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 8.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2021-08-27 16:28:28,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (165)] Forceful destruction successful, exit code 0 [2021-08-27 16:28:29,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (164)] Forceful destruction successful, exit code 0 [2021-08-27 16:28:29,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (163)] Ended with exit code 0 [2021-08-27 16:28:29,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (162)] Forceful destruction successful, exit code 0 [2021-08-27 16:28:29,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (161)] Ended with exit code 0 [2021-08-27 16:28:29,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (160)] Ended with exit code 0 [2021-08-27 16:28:30,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (159)] Forceful destruction successful, exit code 0 [2021-08-27 16:28:30,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (144)] Forceful destruction successful, exit code 0 [2021-08-27 16:28:30,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (143)] Ended with exit code 0 [2021-08-27 16:28:30,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (142)] Forceful destruction successful, exit code 0 [2021-08-27 16:28:30,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (134)] Ended with exit code 0 [2021-08-27 16:28:31,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Ended with exit code 0 [2021-08-27 16:28:31,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...