./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/recursive/Ackermann02_false-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/recursive/Ackermann02_false-unreach-call_true-no-overflow_true-termination.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 dd82318ec795f8c5ba1d6bd1e94de4995b910941 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 23:53:28,481 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:53:28,483 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:53:28,503 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:53:28,503 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:53:28,504 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:53:28,507 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:53:28,509 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:53:28,511 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:53:28,512 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:53:28,513 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:53:28,513 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:53:28,514 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:53:28,515 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:53:28,516 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:53:28,517 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:53:28,518 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:53:28,520 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:53:28,522 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:53:28,523 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:53:28,525 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:53:28,526 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:53:28,528 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:53:28,529 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:53:28,529 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:53:28,530 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:53:28,531 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:53:28,532 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:53:28,533 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:53:28,534 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:53:28,534 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:53:28,535 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:53:28,535 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:53:28,535 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:53:28,536 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:53:28,537 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:53:28,538 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 23:53:28,563 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:53:28,564 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:53:28,565 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:53:28,566 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:53:28,566 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:53:28,566 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:53:28,566 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:53:28,566 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:53:28,566 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:53:28,567 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:53:28,567 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:53:28,568 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:53:28,568 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:53:28,568 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:53:28,568 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:53:28,568 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:53:28,568 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:53:28,569 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:53:28,570 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:53:28,570 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:53:28,570 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:53:28,570 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:53:28,570 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:53:28,571 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:53:28,571 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:53:28,571 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:53:28,571 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:53:28,571 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:53:28,572 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:53:28,573 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:53:28,573 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:53:28,574 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:53:28,574 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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 -> dd82318ec795f8c5ba1d6bd1e94de4995b910941 [2019-01-01 23:53:28,610 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:53:28,630 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:53:28,635 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:53:28,637 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:53:28,637 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:53:28,638 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive/Ackermann02_false-unreach-call_true-no-overflow_true-termination.c [2019-01-01 23:53:28,688 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af3841501/3bc960ed94fa47cfbd34d3d83ea386d9/FLAG9a733ea16 [2019-01-01 23:53:29,156 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:53:29,157 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive/Ackermann02_false-unreach-call_true-no-overflow_true-termination.c [2019-01-01 23:53:29,162 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af3841501/3bc960ed94fa47cfbd34d3d83ea386d9/FLAG9a733ea16 [2019-01-01 23:53:29,515 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af3841501/3bc960ed94fa47cfbd34d3d83ea386d9 [2019-01-01 23:53:29,519 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:53:29,520 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:53:29,521 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:53:29,521 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:53:29,525 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:53:29,526 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:53:29" (1/1) ... [2019-01-01 23:53:29,529 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53427258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:29, skipping insertion in model container [2019-01-01 23:53:29,530 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:53:29" (1/1) ... [2019-01-01 23:53:29,540 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:53:29,561 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:53:29,744 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:53:29,750 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:53:29,776 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:53:29,795 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:53:29,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:29 WrapperNode [2019-01-01 23:53:29,795 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:53:29,797 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:53:29,797 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:53:29,797 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:53:29,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:29" (1/1) ... [2019-01-01 23:53:29,814 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:29" (1/1) ... [2019-01-01 23:53:29,837 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:53:29,837 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:53:29,837 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:53:29,838 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:53:29,849 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:29" (1/1) ... [2019-01-01 23:53:29,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:29" (1/1) ... [2019-01-01 23:53:29,850 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:29" (1/1) ... [2019-01-01 23:53:29,850 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:29" (1/1) ... [2019-01-01 23:53:29,853 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:29" (1/1) ... [2019-01-01 23:53:29,856 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:29" (1/1) ... [2019-01-01 23:53:29,857 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:29" (1/1) ... [2019-01-01 23:53:29,859 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:53:29,859 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:53:29,859 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:53:29,860 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:53:29,860 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:30,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:53:30,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:53:30,001 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2019-01-01 23:53:30,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2019-01-01 23:53:30,340 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:53:30,340 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-01 23:53:30,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:53:30 BoogieIcfgContainer [2019-01-01 23:53:30,341 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:53:30,342 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:53:30,342 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:53:30,346 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:53:30,347 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:53:30,348 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:53:29" (1/3) ... [2019-01-01 23:53:30,349 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@20ce6c8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:53:30, skipping insertion in model container [2019-01-01 23:53:30,349 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:53:30,349 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:29" (2/3) ... [2019-01-01 23:53:30,351 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@20ce6c8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:53:30, skipping insertion in model container [2019-01-01 23:53:30,351 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:53:30,351 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:53:30" (3/3) ... [2019-01-01 23:53:30,353 INFO L375 chiAutomizerObserver]: Analyzing ICFG Ackermann02_false-unreach-call_true-no-overflow_true-termination.c [2019-01-01 23:53:30,433 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:53:30,434 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:53:30,435 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:53:30,435 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:53:30,435 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:53:30,435 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:53:30,436 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:53:30,436 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:53:30,436 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:53:30,464 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-01-01 23:53:30,529 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 23:53:30,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:53:30,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:53:30,541 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 23:53:30,542 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 23:53:30,542 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:53:30,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-01-01 23:53:30,545 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 23:53:30,548 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:53:30,548 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:53:30,553 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 23:53:30,553 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 23:53:30,563 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; 3#L27true assume !(main_~m~0 < 0 || main_~m~0 > 3);main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; 16#L33true assume !(main_~n~0 < 0 || main_~n~0 > 23); 6#L39true call main_#t~ret5 := ackermann(main_~m~0, main_~n~0);< 11#ackermannENTRYtrue [2019-01-01 23:53:30,563 INFO L796 eck$LassoCheckResult]: Loop: 11#ackermannENTRYtrue ~m := #in~m;~n := #in~n; 18#L15true assume !(0 == ~m); 12#L18true assume !(0 == ~n); 5#L21true call #t~ret1 := ackermann(~m, ~n - 1);< 11#ackermannENTRYtrue [2019-01-01 23:53:30,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:30,570 INFO L82 PathProgramCache]: Analyzing trace with hash 959458, now seen corresponding path program 1 times [2019-01-01 23:53:30,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:30,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:30,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:30,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:30,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:30,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:30,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:30,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:30,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1666510, now seen corresponding path program 1 times [2019-01-01 23:53:30,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:30,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:30,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:30,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:30,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:30,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:30,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:30,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1317091631, now seen corresponding path program 1 times [2019-01-01 23:53:30,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:30,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:30,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:30,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:30,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:30,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:30,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:30,919 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:30,920 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:30,920 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:30,920 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:30,920 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:53:30,921 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:30,921 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:30,921 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:30,921 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ackermann02_false-unreach-call_true-no-overflow_true-termination.c_Iteration1_Loop [2019-01-01 23:53:30,921 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:30,922 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:30,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:30,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:30,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:31,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:31,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:31,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:31,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:31,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:31,471 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:31,472 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:31,477 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:31,477 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:31,486 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:31,488 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~m=0} Honda state: {ackermann_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:31,510 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:31,510 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:31,514 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:31,515 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret0=0} Honda state: {ackermann_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:31,535 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:31,536 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:31,547 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:31,547 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=0} Honda state: {ackermann_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:31,569 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:31,569 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:31,586 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:31,586 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret2=0} Honda state: {ackermann_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:31,615 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:31,616 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:31,620 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:31,620 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret1=0} Honda state: {ackermann_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:31,642 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:31,642 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:31,645 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:31,646 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:31,668 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:31,668 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:31,693 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:53:31,693 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:31,721 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:31,721 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~n=-1} Honda state: {ackermann_#in~n=-1} Generalized eigenvectors: [{ackermann_#in~n=0}, {ackermann_#in~n=0}, {ackermann_#in~n=-1}] Lambdas: [0, 0, 1] Nus: [0, 0] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:53:31,759 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:31,759 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:31,773 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:31,774 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~m=7} Honda state: {ackermann_#in~m=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2019-01-01 23:53:31,913 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:31,913 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:31,913 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:31,914 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:31,914 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:53:31,914 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:31,914 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:31,915 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:31,915 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ackermann02_false-unreach-call_true-no-overflow_true-termination.c_Iteration1_Lasso [2019-01-01 23:53:31,915 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:31,915 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:31,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:31,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:31,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:31,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:31,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:31,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:31,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:32,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:32,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:32,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:32,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:32,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:32,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:32,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:32,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:32,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:32,509 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-01 23:53:32,940 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:32,940 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:32,945 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:32,945 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:32,964 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:32,964 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret0=0} Honda state: {ackermann_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:32,992 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:32,992 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:32,996 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:32,996 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~m~0=0} Honda state: {ULTIMATE.start_main_~m~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:33,017 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:33,017 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:33,022 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:33,022 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret5=0} Honda state: {ULTIMATE.start_main_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:33,043 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:33,043 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:33,047 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:33,048 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4=0} Honda state: {ULTIMATE.start_main_#t~nondet4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:33,069 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:33,069 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:53:33,096 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:53:33,096 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:33,122 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:53:33,124 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:33,124 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:33,124 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:33,125 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:33,125 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:53:33,125 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:33,125 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:33,125 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:33,125 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ackermann02_false-unreach-call_true-no-overflow_true-termination.c_Iteration1_Lasso [2019-01-01 23:53:33,125 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:33,126 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:33,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:33,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:33,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:33,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:33,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:33,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:33,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:33,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:33,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:33,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:33,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:33,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:33,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:33,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:33,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:33,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:33,502 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:33,507 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:53:33,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:33,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:33,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:33,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:33,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:33,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:33,514 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:33,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:33,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:33,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:33,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:33,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:33,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:33,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:33,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:33,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:33,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:33,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:33,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:33,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:33,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:33,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:33,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:33,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:33,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:33,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:33,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:33,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:33,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:33,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:33,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:33,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:33,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:33,528 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:33,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:33,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:33,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:33,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:33,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:33,531 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:53:33,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:33,540 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-01-01 23:53:33,540 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-01 23:53:33,694 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:53:33,742 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-01 23:53:33,742 INFO L444 ModelExtractionUtils]: 4 out of 11 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-01 23:53:33,745 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:53:33,751 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2019-01-01 23:53:33,751 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:53:33,752 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ackermann_#in~n) = 1*ackermann_#in~n Supporting invariants [1*ackermann_#in~n >= 0] [2019-01-01 23:53:33,777 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 23:53:34,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:34,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:34,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:34,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:34,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:34,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:53:34,510 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-01 23:53:34,512 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states. Second operand 5 states. [2019-01-01 23:53:34,732 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states.. Second operand 5 states. Result 49 states and 64 transitions. Complement of second has 13 states. [2019-01-01 23:53:34,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 23:53:34,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 23:53:34,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2019-01-01 23:53:34,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 4 letters. Loop has 4 letters. [2019-01-01 23:53:34,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:34,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 8 letters. Loop has 4 letters. [2019-01-01 23:53:34,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:34,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 4 letters. Loop has 8 letters. [2019-01-01 23:53:34,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:34,749 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 64 transitions. [2019-01-01 23:53:34,755 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 23:53:34,763 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 30 states and 41 transitions. [2019-01-01 23:53:34,765 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-01-01 23:53:34,765 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-01-01 23:53:34,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 41 transitions. [2019-01-01 23:53:34,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:53:34,768 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2019-01-01 23:53:34,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 41 transitions. [2019-01-01 23:53:34,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2019-01-01 23:53:34,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-01 23:53:34,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2019-01-01 23:53:34,801 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-01-01 23:53:34,801 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-01-01 23:53:34,801 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:53:34,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 34 transitions. [2019-01-01 23:53:34,803 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 23:53:34,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:53:34,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:53:34,804 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:53:34,804 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 23:53:34,804 INFO L794 eck$LassoCheckResult]: Stem: 159#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; 140#L27 assume !(main_~m~0 < 0 || main_~m~0 > 3);main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; 141#L33 assume !(main_~n~0 < 0 || main_~n~0 > 23); 148#L39 call main_#t~ret5 := ackermann(main_~m~0, main_~n~0);< 150#ackermannENTRY ~m := #in~m;~n := #in~n; 154#L15 assume !(0 == ~m); 165#L18 assume 0 == ~n; 143#L19 call #t~ret0 := ackermann(~m - 1, 1);< 146#ackermannENTRY [2019-01-01 23:53:34,804 INFO L796 eck$LassoCheckResult]: Loop: 146#ackermannENTRY ~m := #in~m;~n := #in~n; 163#L15 assume !(0 == ~m); 162#L18 assume 0 == ~n; 145#L19 call #t~ret0 := ackermann(~m - 1, 1);< 146#ackermannENTRY [2019-01-01 23:53:34,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:34,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1317091536, now seen corresponding path program 1 times [2019-01-01 23:53:34,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:34,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:34,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:34,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:34,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:34,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:34,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:34,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:34,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1666415, now seen corresponding path program 1 times [2019-01-01 23:53:34,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:34,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:34,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:34,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:34,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:34,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:34,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:34,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:34,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1185130174, now seen corresponding path program 2 times [2019-01-01 23:53:34,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:34,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:34,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:34,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:34,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:34,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:34,882 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:53:34,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:53:34,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 23:53:34,994 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:34,994 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:34,994 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:34,994 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:34,995 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:53:34,995 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:34,995 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:34,995 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:34,995 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ackermann02_false-unreach-call_true-no-overflow_true-termination.c_Iteration2_Loop [2019-01-01 23:53:34,996 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:34,996 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:34,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:35,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:35,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:35,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:35,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:35,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:35,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:35,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:35,119 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:35,119 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:35,123 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:35,123 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:35,125 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:35,125 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:35,146 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:35,146 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:35,148 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:35,148 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=0} Honda state: {ackermann_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:35,168 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:35,169 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:35,171 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:35,171 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~m=0} Honda state: {ackermann_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:35,191 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:35,191 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:35,194 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:35,194 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret1=0} Honda state: {ackermann_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:35,213 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:35,214 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:35,216 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:35,216 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret0=0} Honda state: {ackermann_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:35,236 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:35,236 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:35,260 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:53:35,260 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:35,272 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:53:35,289 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:35,289 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:35,289 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:35,289 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:35,289 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:53:35,290 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:35,290 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:35,290 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:35,290 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ackermann02_false-unreach-call_true-no-overflow_true-termination.c_Iteration2_Loop [2019-01-01 23:53:35,290 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:35,290 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:35,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:35,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:35,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:35,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:35,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:35,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:35,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:35,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:35,396 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:35,396 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:53:35,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:35,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:35,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:35,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:35,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:35,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:35,401 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:35,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:35,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:35,403 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:35,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:35,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:35,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:35,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:35,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:35,406 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:35,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:35,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:35,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:35,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:35,410 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:35,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:35,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:35,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:35,411 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:35,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:35,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:35,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:35,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:35,415 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:35,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:35,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:35,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:35,416 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:35,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:35,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:35,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:35,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:35,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:35,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:35,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:35,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:35,419 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:35,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:35,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:35,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:35,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:35,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:35,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:35,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:35,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:35,421 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:35,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:35,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:35,423 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:35,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:35,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:35,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:35,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:35,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:35,424 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:35,424 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:35,427 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:53:35,428 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:53:35,428 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 23:53:35,429 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:53:35,429 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:53:35,429 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:53:35,429 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ackermann_#in~n) = -2*ackermann_#in~n + 1 Supporting invariants [] [2019-01-01 23:53:35,430 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:53:35,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:35,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:35,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:35,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:35,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:53:35,639 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 [2019-01-01 23:53:35,639 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 34 transitions. cyclomatic complexity: 10 Second operand 4 states. [2019-01-01 23:53:35,859 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 34 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 61 states and 85 transitions. Complement of second has 13 states. [2019-01-01 23:53:35,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 23:53:35,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:53:35,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2019-01-01 23:53:35,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 8 letters. Loop has 4 letters. [2019-01-01 23:53:35,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:35,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 12 letters. Loop has 4 letters. [2019-01-01 23:53:35,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:35,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 8 letters. Loop has 8 letters. [2019-01-01 23:53:35,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:35,864 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 85 transitions. [2019-01-01 23:53:35,867 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2019-01-01 23:53:35,871 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 53 states and 77 transitions. [2019-01-01 23:53:35,871 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2019-01-01 23:53:35,871 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2019-01-01 23:53:35,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 77 transitions. [2019-01-01 23:53:35,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:53:35,872 INFO L705 BuchiCegarLoop]: Abstraction has 53 states and 77 transitions. [2019-01-01 23:53:35,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 77 transitions. [2019-01-01 23:53:35,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2019-01-01 23:53:35,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-01 23:53:35,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 67 transitions. [2019-01-01 23:53:35,881 INFO L728 BuchiCegarLoop]: Abstraction has 47 states and 67 transitions. [2019-01-01 23:53:35,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 23:53:35,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 23:53:35,886 INFO L87 Difference]: Start difference. First operand 47 states and 67 transitions. Second operand 4 states. [2019-01-01 23:53:35,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:53:35,955 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2019-01-01 23:53:35,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 23:53:35,956 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 68 transitions. [2019-01-01 23:53:35,959 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2019-01-01 23:53:35,962 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 48 states and 66 transitions. [2019-01-01 23:53:35,962 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2019-01-01 23:53:35,962 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2019-01-01 23:53:35,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 66 transitions. [2019-01-01 23:53:35,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:53:35,963 INFO L705 BuchiCegarLoop]: Abstraction has 48 states and 66 transitions. [2019-01-01 23:53:35,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 66 transitions. [2019-01-01 23:53:35,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2019-01-01 23:53:35,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-01 23:53:35,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2019-01-01 23:53:35,969 INFO L728 BuchiCegarLoop]: Abstraction has 42 states and 58 transitions. [2019-01-01 23:53:35,969 INFO L608 BuchiCegarLoop]: Abstraction has 42 states and 58 transitions. [2019-01-01 23:53:35,969 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:53:35,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 58 transitions. [2019-01-01 23:53:35,971 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2019-01-01 23:53:35,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:53:35,971 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:53:35,971 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:53:35,972 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2019-01-01 23:53:35,972 INFO L794 eck$LassoCheckResult]: Stem: 423#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; 398#L27 assume !(main_~m~0 < 0 || main_~m~0 > 3);main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; 399#L33 assume !(main_~n~0 < 0 || main_~n~0 > 23); 406#L39 call main_#t~ret5 := ackermann(main_~m~0, main_~n~0);< 408#ackermannENTRY ~m := #in~m;~n := #in~n; 427#L15 assume !(0 == ~m); 429#L18 assume 0 == ~n; 413#L19 call #t~ret0 := ackermann(~m - 1, 1);< 414#ackermannENTRY [2019-01-01 23:53:35,972 INFO L796 eck$LassoCheckResult]: Loop: 414#ackermannENTRY ~m := #in~m;~n := #in~n; 416#L15 assume !(0 == ~m); 419#L18 assume !(0 == ~n); 402#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 404#ackermannENTRY ~m := #in~m;~n := #in~n; 434#L15 assume !(0 == ~m); 435#L18 assume 0 == ~n; 415#L19 call #t~ret0 := ackermann(~m - 1, 1);< 414#ackermannENTRY [2019-01-01 23:53:35,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:35,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1317091536, now seen corresponding path program 3 times [2019-01-01 23:53:35,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:35,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:35,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:35,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:53:35,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:35,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:35,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:35,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:35,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1459432636, now seen corresponding path program 1 times [2019-01-01 23:53:35,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:35,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:35,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:35,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:53:35,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:35,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:35,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:35,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1880893067, now seen corresponding path program 1 times [2019-01-01 23:53:36,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:36,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:36,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:36,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:36,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:36,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:36,295 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:36,295 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:36,295 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:36,296 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:36,296 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:53:36,296 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:36,296 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:36,296 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:36,297 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ackermann02_false-unreach-call_true-no-overflow_true-termination.c_Iteration3_Loop [2019-01-01 23:53:36,297 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:36,297 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:36,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:36,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:36,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:36,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:36,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:36,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:36,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:36,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:36,430 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:36,430 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:36,434 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:36,434 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:36,437 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:36,437 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~m=0} Honda state: {ackermann_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:36,457 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:36,457 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:36,461 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:36,461 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~n=1} Honda state: {ackermann_#in~n=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:36,481 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:36,482 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:36,484 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:36,484 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=0} Honda state: {ackermann_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:36,505 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:36,505 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:36,511 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:36,511 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:36,534 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:36,534 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:36,536 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:36,537 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret1=0} Honda state: {ackermann_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:36,557 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:36,558 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:36,570 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:36,570 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret0=0} Honda state: {ackermann_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:36,590 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:36,591 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:36,605 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:36,605 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret2=0} Honda state: {ackermann_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:36,626 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:36,626 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:36,651 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:53:36,651 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:36,665 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:36,665 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~m=-8} Honda state: {ackermann_#in~m=-8} Generalized eigenvectors: [{ackermann_#in~m=0}, {ackermann_#in~m=0}, {ackermann_#in~m=-1}] Lambdas: [15, 0, 1] Nus: [0, 0] [2019-01-01 23:53:36,836 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:36,836 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:36,836 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:36,837 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:36,837 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:53:36,837 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:36,837 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:36,837 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:36,837 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ackermann02_false-unreach-call_true-no-overflow_true-termination.c_Iteration3_Lasso [2019-01-01 23:53:36,838 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:36,838 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:36,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:36,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:36,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:36,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:36,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:36,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:36,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:36,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:36,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:36,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:36,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:36,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:36,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:36,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:36,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:36,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:37,004 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:37,004 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:37,014 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:37,014 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:37,035 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:37,035 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret0=0} Honda state: {ackermann_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:37,062 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:37,062 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:37,065 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:37,065 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret1=0} Honda state: {ackermann_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:37,084 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:37,085 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:37,087 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:37,088 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~n=0} Honda state: {ackermann_#in~n=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:37,108 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:37,109 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:37,111 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:37,111 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet3=0} Honda state: {ULTIMATE.start_main_#t~nondet3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:37,136 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:37,136 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:37,139 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:37,140 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret2=0} Honda state: {ackermann_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:37,160 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:37,160 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:37,163 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:37,163 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~m~0=0} Honda state: {ULTIMATE.start_main_~m~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:37,183 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:37,183 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:37,186 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:37,186 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=0} Honda state: {ackermann_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:37,206 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:37,206 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:37,208 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:37,209 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret5=0} Honda state: {ULTIMATE.start_main_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:53:37,242 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:37,242 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:37,250 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:37,251 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:37,271 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:37,271 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:37,274 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:37,274 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:37,294 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:37,294 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:37,297 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:37,297 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~m=0} Honda state: {ackermann_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:37,317 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:37,317 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:37,320 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:37,320 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~result~0=0} Honda state: {ULTIMATE.start_main_~result~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:53:37,342 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:37,342 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:37,345 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:37,345 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~n~0=0} Honda state: {ULTIMATE.start_main_~n~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:37,365 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:37,365 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:37,368 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:37,368 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4=0} Honda state: {ULTIMATE.start_main_#t~nondet4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:37,387 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:37,387 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:37,409 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:53:37,409 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:37,431 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:53:37,432 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:37,432 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:37,432 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:37,432 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:37,432 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:53:37,432 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:37,433 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:37,433 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:37,433 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ackermann02_false-unreach-call_true-no-overflow_true-termination.c_Iteration3_Lasso [2019-01-01 23:53:37,433 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:37,433 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:37,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:37,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:37,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:37,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:37,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:37,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:37,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:37,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:37,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:37,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:37,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:37,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:37,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:37,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:37,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:37,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:37,612 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:37,612 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:53:37,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:37,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:37,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:37,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:37,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:37,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:37,614 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:37,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:37,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:37,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:37,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:37,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:37,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:37,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:37,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:37,621 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:37,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:37,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:37,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:37,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:37,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:37,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:37,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:37,630 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:53:37,630 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:53:37,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:37,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:37,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:37,652 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:37,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:37,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:37,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:37,655 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:37,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:37,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:37,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:37,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:37,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:37,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:37,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:37,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:37,664 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:37,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:37,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:37,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:37,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:37,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:37,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:37,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:37,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:37,674 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:37,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:37,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:37,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:37,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:37,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:37,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:37,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:37,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:37,686 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:37,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:37,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:37,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:37,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:37,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:37,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:37,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:37,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:37,692 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:37,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:37,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:37,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:37,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:37,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:37,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:37,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:37,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:37,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:37,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:37,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:37,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:37,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:37,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:37,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:37,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:37,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:37,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:37,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:37,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:37,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:37,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:37,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:37,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:37,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:37,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:37,709 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:37,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:37,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:37,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:37,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:37,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:37,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:37,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:37,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:37,711 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:37,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:37,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:37,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:37,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:37,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:37,722 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:53:37,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:37,728 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-01-01 23:53:37,728 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-01 23:53:37,756 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:53:37,791 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-01-01 23:53:37,795 INFO L444 ModelExtractionUtils]: 3 out of 11 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-01-01 23:53:37,795 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:53:37,800 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2019-01-01 23:53:37,802 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:53:37,803 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ackermann_#in~m) = 1*ackermann_#in~m Supporting invariants [1*ackermann_#in~m >= 0] [2019-01-01 23:53:37,832 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 23:53:37,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:37,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:37,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:38,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:38,252 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 23:53:38,253 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 [2019-01-01 23:53:38,253 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 58 transitions. cyclomatic complexity: 19 Second operand 9 states. [2019-01-01 23:53:38,690 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 58 transitions. cyclomatic complexity: 19. Second operand 9 states. Result 139 states and 195 transitions. Complement of second has 32 states. [2019-01-01 23:53:38,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 5 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-01 23:53:38,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-01 23:53:38,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2019-01-01 23:53:38,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 52 transitions. Stem has 8 letters. Loop has 8 letters. [2019-01-01 23:53:38,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:38,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 52 transitions. Stem has 16 letters. Loop has 8 letters. [2019-01-01 23:53:38,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:38,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 52 transitions. Stem has 8 letters. Loop has 16 letters. [2019-01-01 23:53:38,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:38,694 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 195 transitions. [2019-01-01 23:53:38,699 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2019-01-01 23:53:38,703 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 85 states and 119 transitions. [2019-01-01 23:53:38,703 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2019-01-01 23:53:38,703 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2019-01-01 23:53:38,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 119 transitions. [2019-01-01 23:53:38,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:53:38,704 INFO L705 BuchiCegarLoop]: Abstraction has 85 states and 119 transitions. [2019-01-01 23:53:38,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 119 transitions. [2019-01-01 23:53:38,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 69. [2019-01-01 23:53:38,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-01 23:53:38,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 98 transitions. [2019-01-01 23:53:38,713 INFO L728 BuchiCegarLoop]: Abstraction has 69 states and 98 transitions. [2019-01-01 23:53:38,713 INFO L608 BuchiCegarLoop]: Abstraction has 69 states and 98 transitions. [2019-01-01 23:53:38,714 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 23:53:38,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 98 transitions. [2019-01-01 23:53:38,715 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2019-01-01 23:53:38,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:53:38,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:53:38,716 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 23:53:38,716 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 23:53:38,717 INFO L794 eck$LassoCheckResult]: Stem: 733#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; 701#L27 assume !(main_~m~0 < 0 || main_~m~0 > 3);main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; 702#L33 assume !(main_~n~0 < 0 || main_~n~0 > 23); 710#L39 call main_#t~ret5 := ackermann(main_~m~0, main_~n~0);< 711#ackermannENTRY ~m := #in~m;~n := #in~n; 765#L15 assume !(0 == ~m); 768#L18 assume 0 == ~n; 706#L19 call #t~ret0 := ackermann(~m - 1, 1);< 714#ackermannENTRY ~m := #in~m;~n := #in~n; 746#L15 assume !(0 == ~m); 731#L18 [2019-01-01 23:53:38,717 INFO L796 eck$LassoCheckResult]: Loop: 731#L18 assume !(0 == ~n); 703#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 704#ackermannENTRY ~m := #in~m;~n := #in~n; 723#L15 assume !(0 == ~m); 731#L18 [2019-01-01 23:53:38,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:38,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1290385452, now seen corresponding path program 4 times [2019-01-01 23:53:38,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:38,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:38,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:38,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:38,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:38,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:38,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:38,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:38,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1978510, now seen corresponding path program 2 times [2019-01-01 23:53:38,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:38,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:38,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:38,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:53:38,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:38,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:38,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:38,734 INFO L82 PathProgramCache]: Analyzing trace with hash 743855841, now seen corresponding path program 2 times [2019-01-01 23:53:38,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:38,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:38,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:38,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:53:38,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:38,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:38,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:38,840 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:38,840 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:38,840 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:38,840 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:38,841 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:53:38,841 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:38,841 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:38,841 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:38,841 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ackermann02_false-unreach-call_true-no-overflow_true-termination.c_Iteration4_Loop [2019-01-01 23:53:38,841 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:38,842 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:38,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:38,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:38,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:38,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:38,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:38,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:39,056 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:39,056 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:39,060 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:39,060 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:39,062 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:39,063 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:53:39,098 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:39,099 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:39,112 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:39,112 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret2=0} Honda state: {ackermann_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:39,133 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:39,133 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:39,160 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:53:39,160 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:39,483 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:39,483 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=-6, ackermann_#in~n=-3} Honda state: {ackermann_~n=-6, ackermann_#in~n=-3} Generalized eigenvectors: [{ackermann_~n=0, ackermann_#in~n=5}, {ackermann_~n=0, ackermann_#in~n=-8}, {ackermann_~n=-1, ackermann_#in~n=-1}] Lambdas: [0, 0, 1] Nus: [0, 0] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:53:39,503 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:39,503 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:39,517 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:39,517 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret1=0} Honda state: {ackermann_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:53:39,547 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:39,547 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:39,559 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:39,559 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret0=0} Honda state: {ackermann_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:53:39,591 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:39,591 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:39,604 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:39,604 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~m=-8, ackermann_~m=-8} Honda state: {ackermann_#in~m=-8, ackermann_~m=-8} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2019-01-01 23:53:39,743 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-01 23:53:39,995 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:39,995 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:39,995 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:39,995 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:39,995 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:53:39,995 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:39,996 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:39,996 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:39,996 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ackermann02_false-unreach-call_true-no-overflow_true-termination.c_Iteration4_Lasso [2019-01-01 23:53:39,996 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:39,996 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:39,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:40,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:40,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:40,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:40,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:40,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:40,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:40,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:40,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:40,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:40,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:40,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:40,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:40,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:40,199 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:40,200 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:40,206 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:40,206 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:40,213 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:40,213 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret5=0} Honda state: {ULTIMATE.start_main_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:40,233 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:40,233 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:40,235 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:40,235 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret1=0} Honda state: {ackermann_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:40,255 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:40,255 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:40,258 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:40,258 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret0=0} Honda state: {ackermann_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:40,281 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:40,282 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:40,284 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:40,284 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_#t~ret6=0} Honda state: {ULTIMATE.start_#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:40,304 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:40,304 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:40,306 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:40,306 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret2=0} Honda state: {ackermann_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:40,328 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:40,328 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:40,334 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:40,334 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:40,353 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:40,354 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:40,356 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:40,356 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~m~0=0} Honda state: {ULTIMATE.start_main_~m~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:40,376 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:40,376 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:40,381 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:40,381 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~m=0, ackermann_~m=0} Honda state: {ackermann_#in~m=2, ackermann_~m=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:40,401 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:40,401 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:40,404 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:40,405 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:40,425 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:40,425 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:40,447 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:53:40,447 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:40,608 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:53:40,610 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:40,610 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:40,610 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:40,610 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:40,610 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:53:40,610 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:40,611 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:40,611 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:40,611 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ackermann02_false-unreach-call_true-no-overflow_true-termination.c_Iteration4_Lasso [2019-01-01 23:53:40,611 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:40,611 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:40,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:40,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:40,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:40,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:40,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:40,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:40,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:40,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:40,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:40,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:40,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:40,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:40,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:40,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:41,018 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:41,019 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:53:41,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:41,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:41,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:41,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:41,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:41,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:41,025 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:41,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:41,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:41,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:41,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:41,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:41,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:41,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:41,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:41,028 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:41,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:41,029 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:41,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:41,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:41,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:41,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:41,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:41,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:41,030 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:41,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:41,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:41,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:41,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:41,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:41,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:41,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:41,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:41,033 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:41,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:41,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:41,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:41,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:41,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:41,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:41,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:41,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:41,035 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:41,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:41,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:41,036 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:41,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:41,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:41,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:41,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:41,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:41,039 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:41,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:41,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:41,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:41,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:41,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:41,041 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:53:41,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:41,052 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-01-01 23:53:41,052 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-01 23:53:41,086 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:41,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:41,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:41,088 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:41,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:41,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:41,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:41,088 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:41,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:41,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:41,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:41,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:41,090 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:41,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:41,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:41,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:41,091 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:41,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:41,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:41,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:41,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:41,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:41,092 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:53:41,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:41,095 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-01-01 23:53:41,095 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-01 23:53:41,154 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:53:41,177 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-01 23:53:41,177 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 23:53:41,177 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:53:41,179 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2019-01-01 23:53:41,179 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:53:41,179 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ackermann_~n) = 1*ackermann_~n Supporting invariants [1*ackermann_~n >= 0] [2019-01-01 23:53:41,199 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 23:53:41,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:41,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:41,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:41,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:41,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:41,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:53:41,406 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 [2019-01-01 23:53:41,406 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 98 transitions. cyclomatic complexity: 34 Second operand 7 states. [2019-01-01 23:53:41,442 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 98 transitions. cyclomatic complexity: 34. Second operand 7 states. Result 70 states and 99 transitions. Complement of second has 6 states. [2019-01-01 23:53:41,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 23:53:41,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 23:53:41,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-01 23:53:41,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 10 letters. Loop has 4 letters. [2019-01-01 23:53:41,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:41,443 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:53:41,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:41,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:41,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:41,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:41,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:53:41,553 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 [2019-01-01 23:53:41,553 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 98 transitions. cyclomatic complexity: 34 Second operand 7 states. [2019-01-01 23:53:41,585 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 98 transitions. cyclomatic complexity: 34. Second operand 7 states. Result 70 states and 99 transitions. Complement of second has 6 states. [2019-01-01 23:53:41,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 23:53:41,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 23:53:41,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-01 23:53:41,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 10 letters. Loop has 4 letters. [2019-01-01 23:53:41,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:41,589 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:53:41,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:41,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:41,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:41,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:41,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:41,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:53:41,711 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 [2019-01-01 23:53:41,712 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 98 transitions. cyclomatic complexity: 34 Second operand 7 states. [2019-01-01 23:53:41,849 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 98 transitions. cyclomatic complexity: 34. Second operand 7 states. Result 141 states and 191 transitions. Complement of second has 38 states. [2019-01-01 23:53:41,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 3 stem states 3 non-accepting loop states 2 accepting loop states [2019-01-01 23:53:41,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 23:53:41,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2019-01-01 23:53:41,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 10 letters. Loop has 4 letters. [2019-01-01 23:53:41,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:41,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 14 letters. Loop has 4 letters. [2019-01-01 23:53:41,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:41,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 10 letters. Loop has 8 letters. [2019-01-01 23:53:41,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:41,853 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 191 transitions. [2019-01-01 23:53:41,857 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 34 [2019-01-01 23:53:41,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 98 states and 142 transitions. [2019-01-01 23:53:41,861 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2019-01-01 23:53:41,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2019-01-01 23:53:41,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 142 transitions. [2019-01-01 23:53:41,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:53:41,862 INFO L705 BuchiCegarLoop]: Abstraction has 98 states and 142 transitions. [2019-01-01 23:53:41,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 142 transitions. [2019-01-01 23:53:41,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2019-01-01 23:53:41,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-01 23:53:41,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2019-01-01 23:53:41,873 INFO L728 BuchiCegarLoop]: Abstraction has 96 states and 138 transitions. [2019-01-01 23:53:41,873 INFO L608 BuchiCegarLoop]: Abstraction has 96 states and 138 transitions. [2019-01-01 23:53:41,873 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 23:53:41,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 138 transitions. [2019-01-01 23:53:41,880 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2019-01-01 23:53:41,880 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:53:41,881 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:53:41,882 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:53:41,882 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 23:53:41,882 INFO L794 eck$LassoCheckResult]: Stem: 1316#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; 1278#L27 assume !(main_~m~0 < 0 || main_~m~0 > 3);main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; 1279#L33 assume !(main_~n~0 < 0 || main_~n~0 > 23); 1285#L39 call main_#t~ret5 := ackermann(main_~m~0, main_~n~0);< 1287#ackermannENTRY ~m := #in~m;~n := #in~n; 1296#L15 assume !(0 == ~m); 1373#L18 assume !(0 == ~n); 1284#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 1286#ackermannENTRY ~m := #in~m;~n := #in~n; 1299#L15 assume 0 == ~m;#res := 1 + ~n; 1319#ackermannFINAL assume true; 1320#ackermannEXIT >#44#return; 1281#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 1283#ackermannENTRY [2019-01-01 23:53:41,882 INFO L796 eck$LassoCheckResult]: Loop: 1283#ackermannENTRY ~m := #in~m;~n := #in~n; 1372#L15 assume !(0 == ~m); 1371#L18 assume !(0 == ~n); 1280#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 1283#ackermannENTRY [2019-01-01 23:53:41,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:41,882 INFO L82 PathProgramCache]: Analyzing trace with hash 804076149, now seen corresponding path program 1 times [2019-01-01 23:53:41,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:41,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:41,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:41,885 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:53:41,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:41,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 23:53:41,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:53:41,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:53:41,933 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:53:41,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:41,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1666510, now seen corresponding path program 3 times [2019-01-01 23:53:41,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:41,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:41,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:41,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:41,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:41,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:42,038 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:42,038 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:42,038 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:42,039 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:42,039 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:53:42,039 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:42,039 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:42,039 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:42,039 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ackermann02_false-unreach-call_true-no-overflow_true-termination.c_Iteration5_Loop [2019-01-01 23:53:42,040 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:42,040 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:42,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:42,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:42,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:42,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:42,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:42,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:42,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:42,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:42,166 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:42,167 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:42,171 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:42,172 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:42,176 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:42,176 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret2=0} Honda state: {ackermann_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:42,197 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:42,198 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:42,200 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:42,200 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:42,220 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:42,220 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:42,223 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:42,223 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=0} Honda state: {ackermann_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:42,243 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:42,243 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:42,245 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:42,245 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~m=0} Honda state: {ackermann_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:42,266 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:42,266 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:42,289 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:53:42,289 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:42,301 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:42,301 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~n=-1} Honda state: {ackermann_#in~n=-1} Generalized eigenvectors: [{ackermann_#in~n=0}, {ackermann_#in~n=0}, {ackermann_#in~n=-1}] Lambdas: [0, 0, 1] Nus: [0, 0] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:42,322 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:42,322 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:42,325 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:42,325 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~m=7} Honda state: {ackermann_#in~m=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:42,345 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:42,345 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:42,347 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:42,348 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret1=0} Honda state: {ackermann_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:42,368 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:42,368 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:42,371 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:42,371 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret0=0} Honda state: {ackermann_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2019-01-01 23:53:42,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:53:42,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:53:42,390 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. cyclomatic complexity: 46 Second operand 5 states. [2019-01-01 23:53:42,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:53:42,475 INFO L93 Difference]: Finished difference Result 91 states and 122 transitions. [2019-01-01 23:53:42,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 23:53:42,478 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 122 transitions. [2019-01-01 23:53:42,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2019-01-01 23:53:42,486 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 85 states and 116 transitions. [2019-01-01 23:53:42,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2019-01-01 23:53:42,486 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2019-01-01 23:53:42,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 116 transitions. [2019-01-01 23:53:42,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:53:42,489 INFO L705 BuchiCegarLoop]: Abstraction has 85 states and 116 transitions. [2019-01-01 23:53:42,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 116 transitions. [2019-01-01 23:53:42,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2019-01-01 23:53:42,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-01 23:53:42,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 112 transitions. [2019-01-01 23:53:42,506 INFO L728 BuchiCegarLoop]: Abstraction has 82 states and 112 transitions. [2019-01-01 23:53:42,506 INFO L608 BuchiCegarLoop]: Abstraction has 82 states and 112 transitions. [2019-01-01 23:53:42,506 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 23:53:42,506 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 112 transitions. [2019-01-01 23:53:42,507 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2019-01-01 23:53:42,508 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:53:42,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:53:42,516 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:53:42,516 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:53:42,517 INFO L794 eck$LassoCheckResult]: Stem: 1508#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; 1477#L27 assume !(main_~m~0 < 0 || main_~m~0 > 3);main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; 1478#L33 assume !(main_~n~0 < 0 || main_~n~0 > 23); 1485#L39 call main_#t~ret5 := ackermann(main_~m~0, main_~n~0);< 1486#ackermannENTRY ~m := #in~m;~n := #in~n; 1502#L15 assume !(0 == ~m); 1505#L18 assume 0 == ~n; 1489#L19 call #t~ret0 := ackermann(~m - 1, 1);< 1490#ackermannENTRY ~m := #in~m;~n := #in~n; 1527#L15 assume !(0 == ~m); 1552#L18 assume !(0 == ~n); 1488#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 1531#ackermannENTRY ~m := #in~m;~n := #in~n; 1557#L15 assume !(0 == ~m); 1541#L18 assume 0 == ~n; 1491#L19 call #t~ret0 := ackermann(~m - 1, 1);< 1492#ackermannENTRY ~m := #in~m;~n := #in~n; 1525#L15 assume 0 == ~m;#res := 1 + ~n; 1523#ackermannFINAL assume true; 1517#ackermannEXIT >#42#return; 1519#L19-1 #res := #t~ret0;havoc #t~ret0; 1533#ackermannFINAL assume true; 1530#ackermannEXIT >#44#return; 1480#L21-1 [2019-01-01 23:53:42,517 INFO L796 eck$LassoCheckResult]: Loop: 1480#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 1529#ackermannENTRY ~m := #in~m;~n := #in~n; 1534#L15 assume !(0 == ~m); 1535#L18 assume 0 == ~n; 1521#L19 call #t~ret0 := ackermann(~m - 1, 1);< 1522#ackermannENTRY ~m := #in~m;~n := #in~n; 1549#L15 assume !(0 == ~m); 1548#L18 assume !(0 == ~n); 1483#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 1547#ackermannENTRY ~m := #in~m;~n := #in~n; 1545#L15 assume !(0 == ~m); 1542#L18 assume 0 == ~n; 1521#L19 call #t~ret0 := ackermann(~m - 1, 1);< 1522#ackermannENTRY ~m := #in~m;~n := #in~n; 1549#L15 assume 0 == ~m;#res := 1 + ~n; 1550#ackermannFINAL assume true; 1551#ackermannEXIT >#42#return; 1519#L19-1 #res := #t~ret0;havoc #t~ret0; 1533#ackermannFINAL assume true; 1530#ackermannEXIT >#44#return; 1480#L21-1 [2019-01-01 23:53:42,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:42,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1914958677, now seen corresponding path program 1 times [2019-01-01 23:53:42,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:42,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:42,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:42,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:53:42,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:42,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:42,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:42,552 INFO L82 PathProgramCache]: Analyzing trace with hash -190850389, now seen corresponding path program 1 times [2019-01-01 23:53:42,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:42,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:42,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:42,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:42,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:42,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:42,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:42,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1249696767, now seen corresponding path program 1 times [2019-01-01 23:53:42,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:42,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:42,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:42,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:42,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:42,793 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 48 proven. 33 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-01 23:53:42,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:53:42,793 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:53:42,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:42,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:42,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:43,001 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 65 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-01-01 23:53:43,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:53:43,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 21 [2019-01-01 23:53:43,412 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:43,412 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:43,412 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:43,412 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:43,413 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:53:43,413 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:43,413 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:43,413 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:43,413 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ackermann02_false-unreach-call_true-no-overflow_true-termination.c_Iteration6_Loop [2019-01-01 23:53:43,413 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:43,413 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:43,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:43,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:43,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:43,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:43,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:43,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:43,503 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:43,503 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:53:43,515 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:43,516 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:43,521 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:43,521 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:43,541 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:43,541 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:43,566 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:53:43,566 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:44,341 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:53:44,343 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:44,343 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:44,343 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:44,343 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:44,343 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:53:44,343 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:44,343 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:44,343 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:44,344 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ackermann02_false-unreach-call_true-no-overflow_true-termination.c_Iteration6_Loop [2019-01-01 23:53:44,344 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:44,344 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:44,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:44,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:44,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:44,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:44,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:44,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:44,430 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:44,432 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:53:44,432 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:44,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:44,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:44,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:44,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:44,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:44,435 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:44,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:44,436 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:44,437 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:44,437 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:44,437 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:44,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:44,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:44,438 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:44,438 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:44,438 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:44,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:44,439 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:44,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:44,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:44,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:44,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:44,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:44,441 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:44,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:44,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:44,447 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:44,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:44,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:44,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:44,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:44,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:44,449 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:44,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:44,451 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:53:44,453 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:53:44,460 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:53:44,463 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:53:44,463 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:53:44,463 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:53:44,463 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ackermann_~m) = 1*ackermann_~m Supporting invariants [] [2019-01-01 23:53:44,463 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:53:44,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:44,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:44,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:44,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:44,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:44,677 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 23:53:44,677 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 9 loop predicates [2019-01-01 23:53:44,678 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 112 transitions. cyclomatic complexity: 33 Second operand 11 states. [2019-01-01 23:53:44,963 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 82 states and 112 transitions. cyclomatic complexity: 33. Second operand 11 states. Result 180 states and 253 transitions. Complement of second has 31 states. [2019-01-01 23:53:44,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2019-01-01 23:53:44,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-01 23:53:44,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2019-01-01 23:53:44,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 31 transitions. Stem has 23 letters. Loop has 20 letters. [2019-01-01 23:53:44,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:44,968 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:53:45,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:45,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:45,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:45,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:45,186 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 23:53:45,187 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 9 loop predicates [2019-01-01 23:53:45,187 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 112 transitions. cyclomatic complexity: 33 Second operand 11 states. [2019-01-01 23:53:45,823 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 82 states and 112 transitions. cyclomatic complexity: 33. Second operand 11 states. Result 288 states and 426 transitions. Complement of second has 49 states. [2019-01-01 23:53:45,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2019-01-01 23:53:45,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-01 23:53:45,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 44 transitions. [2019-01-01 23:53:45,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 44 transitions. Stem has 23 letters. Loop has 20 letters. [2019-01-01 23:53:45,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:45,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 44 transitions. Stem has 43 letters. Loop has 20 letters. [2019-01-01 23:53:45,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:45,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 44 transitions. Stem has 23 letters. Loop has 40 letters. [2019-01-01 23:53:45,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:45,832 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 288 states and 426 transitions. [2019-01-01 23:53:45,845 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 47 [2019-01-01 23:53:45,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 288 states to 227 states and 351 transitions. [2019-01-01 23:53:45,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 128 [2019-01-01 23:53:45,863 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 130 [2019-01-01 23:53:45,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 227 states and 351 transitions. [2019-01-01 23:53:45,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:53:45,867 INFO L705 BuchiCegarLoop]: Abstraction has 227 states and 351 transitions. [2019-01-01 23:53:45,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states and 351 transitions. [2019-01-01 23:53:45,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 212. [2019-01-01 23:53:45,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-01-01 23:53:45,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 327 transitions. [2019-01-01 23:53:45,893 INFO L728 BuchiCegarLoop]: Abstraction has 212 states and 327 transitions. [2019-01-01 23:53:45,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-01 23:53:45,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2019-01-01 23:53:45,894 INFO L87 Difference]: Start difference. First operand 212 states and 327 transitions. Second operand 21 states. [2019-01-01 23:53:47,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:53:47,758 INFO L93 Difference]: Finished difference Result 458 states and 602 transitions. [2019-01-01 23:53:47,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-01 23:53:47,760 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 458 states and 602 transitions. [2019-01-01 23:53:47,767 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 49 [2019-01-01 23:53:47,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 458 states to 410 states and 537 transitions. [2019-01-01 23:53:47,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 277 [2019-01-01 23:53:47,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 310 [2019-01-01 23:53:47,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 410 states and 537 transitions. [2019-01-01 23:53:47,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:53:47,779 INFO L705 BuchiCegarLoop]: Abstraction has 410 states and 537 transitions. [2019-01-01 23:53:47,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states and 537 transitions. [2019-01-01 23:53:47,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 341. [2019-01-01 23:53:47,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-01-01 23:53:47,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 462 transitions. [2019-01-01 23:53:47,807 INFO L728 BuchiCegarLoop]: Abstraction has 341 states and 462 transitions. [2019-01-01 23:53:47,807 INFO L608 BuchiCegarLoop]: Abstraction has 341 states and 462 transitions. [2019-01-01 23:53:47,807 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 23:53:47,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 341 states and 462 transitions. [2019-01-01 23:53:47,813 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 34 [2019-01-01 23:53:47,814 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:53:47,814 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:53:47,817 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:53:47,817 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 23:53:47,817 INFO L794 eck$LassoCheckResult]: Stem: 3362#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; 3310#L27 assume !(main_~m~0 < 0 || main_~m~0 > 3);main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; 3311#L33 assume !(main_~n~0 < 0 || main_~n~0 > 23); 3333#L39 call main_#t~ret5 := ackermann(main_~m~0, main_~n~0);< 3334#ackermannENTRY ~m := #in~m;~n := #in~n; 3405#L15 assume !(0 == ~m); 3404#L18 assume 0 == ~n; 3336#L19 call #t~ret0 := ackermann(~m - 1, 1);< 3397#ackermannENTRY ~m := #in~m;~n := #in~n; 3402#L15 assume !(0 == ~m); 3411#L18 assume !(0 == ~n); 3382#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 3407#ackermannENTRY ~m := #in~m;~n := #in~n; 3388#L15 assume !(0 == ~m); 3381#L18 assume 0 == ~n; 3383#L19 call #t~ret0 := ackermann(~m - 1, 1);< 3347#ackermannENTRY ~m := #in~m;~n := #in~n; 3480#L15 assume 0 == ~m;#res := 1 + ~n; 3494#ackermannFINAL assume true; 3415#ackermannEXIT >#42#return; 3416#L19-1 #res := #t~ret0;havoc #t~ret0; 3622#ackermannFINAL assume true; 3620#ackermannEXIT >#44#return; 3316#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 3337#ackermannENTRY ~m := #in~m;~n := #in~n; 3644#L15 assume !(0 == ~m); 3352#L18 assume !(0 == ~n); 3312#L21 [2019-01-01 23:53:47,818 INFO L796 eck$LassoCheckResult]: Loop: 3312#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 3318#ackermannENTRY ~m := #in~m;~n := #in~n; 3348#L15 assume !(0 == ~m); 3363#L18 assume !(0 == ~n); 3312#L21 [2019-01-01 23:53:47,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:47,820 INFO L82 PathProgramCache]: Analyzing trace with hash 229970726, now seen corresponding path program 2 times [2019-01-01 23:53:47,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:47,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:47,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:47,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:47,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:47,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:47,981 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-01 23:53:47,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:53:47,981 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:53:47,991 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 23:53:48,004 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 23:53:48,005 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 23:53:48,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:48,056 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-01 23:53:48,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:53:48,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-01 23:53:48,078 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:53:48,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:48,079 INFO L82 PathProgramCache]: Analyzing trace with hash 2228500, now seen corresponding path program 4 times [2019-01-01 23:53:48,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:48,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:48,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:48,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:53:48,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:48,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:48,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:48,161 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:48,161 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:48,161 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:48,161 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:48,161 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:53:48,162 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:48,162 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:48,162 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:48,162 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ackermann02_false-unreach-call_true-no-overflow_true-termination.c_Iteration7_Loop [2019-01-01 23:53:48,162 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:48,162 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:48,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:48,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:48,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:48,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:48,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:48,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:48,323 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:48,323 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:53:48,334 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:48,335 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:48,339 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:48,339 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret0=0} Honda state: {ackermann_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:48,361 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:48,361 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:48,371 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:48,371 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret2=0} Honda state: {ackermann_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:53:48,390 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:48,391 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:48,394 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:48,394 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret1=0} Honda state: {ackermann_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:48,414 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:48,414 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:48,416 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:48,417 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:48,437 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:48,437 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:48,442 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:48,442 INFO L448 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: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:48,462 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:48,462 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:48,489 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:53:48,489 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:48,679 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:48,679 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=-4, ackermann_#in~n=-8} Honda state: {ackermann_~n=-4, ackermann_#in~n=-8} Generalized eigenvectors: [{ackermann_~n=-1, ackermann_#in~n=0}, {ackermann_~n=0, ackermann_#in~n=-1}, {ackermann_~n=0, ackermann_#in~n=4}] Lambdas: [1, 4, 0] Nus: [1, 1] [2019-01-01 23:53:48,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 23:53:48,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 23:53:48,697 INFO L87 Difference]: Start difference. First operand 341 states and 462 transitions. cyclomatic complexity: 134 Second operand 7 states. [2019-01-01 23:53:48,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:53:48,808 INFO L93 Difference]: Finished difference Result 255 states and 320 transitions. [2019-01-01 23:53:48,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 23:53:48,810 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 255 states and 320 transitions. [2019-01-01 23:53:48,813 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2019-01-01 23:53:48,817 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 255 states to 229 states and 287 transitions. [2019-01-01 23:53:48,817 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 182 [2019-01-01 23:53:48,817 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 182 [2019-01-01 23:53:48,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 229 states and 287 transitions. [2019-01-01 23:53:48,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:53:48,818 INFO L705 BuchiCegarLoop]: Abstraction has 229 states and 287 transitions. [2019-01-01 23:53:48,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states and 287 transitions. [2019-01-01 23:53:48,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 212. [2019-01-01 23:53:48,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-01-01 23:53:48,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 268 transitions. [2019-01-01 23:53:48,829 INFO L728 BuchiCegarLoop]: Abstraction has 212 states and 268 transitions. [2019-01-01 23:53:48,829 INFO L608 BuchiCegarLoop]: Abstraction has 212 states and 268 transitions. [2019-01-01 23:53:48,830 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 23:53:48,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 212 states and 268 transitions. [2019-01-01 23:53:48,832 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2019-01-01 23:53:48,832 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:53:48,832 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:53:48,833 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 6, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 23:53:48,833 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 23:53:48,834 INFO L794 eck$LassoCheckResult]: Stem: 4037#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; 3999#L27 assume !(main_~m~0 < 0 || main_~m~0 > 3);main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; 4000#L33 assume !(main_~n~0 < 0 || main_~n~0 > 23); 4011#L39 call main_#t~ret5 := ackermann(main_~m~0, main_~n~0);< 4012#ackermannENTRY ~m := #in~m;~n := #in~n; 4064#L15 assume !(0 == ~m); 4058#L18 assume 0 == ~n; 4049#L19 call #t~ret0 := ackermann(~m - 1, 1);< 4057#ackermannENTRY ~m := #in~m;~n := #in~n; 4055#L15 assume !(0 == ~m); 4056#L18 assume !(0 == ~n); 4042#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 4047#ackermannENTRY ~m := #in~m;~n := #in~n; 4048#L15 assume !(0 == ~m); 4041#L18 assume 0 == ~n; 4043#L19 call #t~ret0 := ackermann(~m - 1, 1);< 4021#ackermannENTRY ~m := #in~m;~n := #in~n; 4110#L15 assume !(0 == ~m); 4108#L18 assume !(0 == ~n); 4104#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 4105#ackermannENTRY ~m := #in~m;~n := #in~n; 4120#L15 assume !(0 == ~m); 4118#L18 assume 0 == ~n; 4112#L19 call #t~ret0 := ackermann(~m - 1, 1);< 4115#ackermannENTRY ~m := #in~m;~n := #in~n; 4119#L15 assume 0 == ~m;#res := 1 + ~n; 4117#ackermannFINAL assume true; 4111#ackermannEXIT >#42#return; 4109#L19-1 #res := #t~ret0;havoc #t~ret0; 4107#ackermannFINAL assume true; 4103#ackermannEXIT >#44#return; 4100#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 4101#ackermannENTRY ~m := #in~m;~n := #in~n; 4106#L15 assume 0 == ~m;#res := 1 + ~n; 4102#ackermannFINAL assume true; 4099#ackermannEXIT >#46#return; 4098#L21-2 #res := #t~ret2;havoc #t~ret1;havoc #t~ret2; 4097#ackermannFINAL assume true; 4086#ackermannEXIT >#42#return; 4077#L19-1 #res := #t~ret0;havoc #t~ret0; 4075#ackermannFINAL assume true; 4070#ackermannEXIT >#44#return; 4035#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 4066#ackermannENTRY ~m := #in~m;~n := #in~n; 4053#L15 assume !(0 == ~m); 4051#L18 assume !(0 == ~n); 4004#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 4005#ackermannENTRY [2019-01-01 23:53:48,834 INFO L796 eck$LassoCheckResult]: Loop: 4005#ackermannENTRY ~m := #in~m;~n := #in~n; 4162#L15 assume !(0 == ~m); 4156#L18 assume !(0 == ~n); 4001#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 4005#ackermannENTRY [2019-01-01 23:53:48,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:48,834 INFO L82 PathProgramCache]: Analyzing trace with hash 2042677982, now seen corresponding path program 1 times [2019-01-01 23:53:48,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:48,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:48,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:48,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:53:48,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:48,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:48,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:48,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:48,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1666510, now seen corresponding path program 5 times [2019-01-01 23:53:48,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:48,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:48,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:48,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:48,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:48,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:48,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:48,854 INFO L82 PathProgramCache]: Analyzing trace with hash -997227989, now seen corresponding path program 2 times [2019-01-01 23:53:48,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:48,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:48,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:48,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:53:48,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:48,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:48,981 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:48,981 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:48,981 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:48,981 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:48,981 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:53:48,981 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:48,981 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:48,982 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:48,982 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ackermann02_false-unreach-call_true-no-overflow_true-termination.c_Iteration8_Loop [2019-01-01 23:53:48,982 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:48,982 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:48,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:49,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:49,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:49,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:49,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:49,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:49,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:49,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:49,137 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:49,137 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:49,142 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:49,143 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:49,146 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:49,146 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret0=0} Honda state: {ackermann_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:49,165 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:49,165 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:53:49,218 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:53:49,218 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 90 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:49,236 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:49,236 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~n=-1} Honda state: {ackermann_#in~n=-1} Generalized eigenvectors: [{ackermann_#in~n=0}, {ackermann_#in~n=0}, {ackermann_#in~n=-1}] Lambdas: [0, 0, 1] Nus: [0, 0] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:53:49,267 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:49,267 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 91 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:49,280 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:49,281 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret1=0} Honda state: {ackermann_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:49,306 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:49,306 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:49,309 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:49,309 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:49,329 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:49,329 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:49,331 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:49,331 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~m=0} Honda state: {ackermann_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:49,351 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:49,351 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:49,354 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:49,354 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=0} Honda state: {ackermann_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:49,374 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:49,374 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:49,377 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:49,377 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret2=0} Honda state: {ackermann_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:49,396 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:49,396 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:49,399 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:49,400 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~m=-1} Honda state: {ackermann_#in~m=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2019-01-01 23:53:50,211 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-01 23:53:50,327 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-01 23:53:50,385 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:50,385 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:50,385 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:50,386 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:50,386 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:53:50,386 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:50,386 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:50,386 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:50,386 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ackermann02_false-unreach-call_true-no-overflow_true-termination.c_Iteration8_Lasso [2019-01-01 23:53:50,387 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:50,387 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:50,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:50,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:50,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:50,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:50,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:50,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:50,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:50,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:50,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:50,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:50,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:50,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:50,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:50,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:50,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:50,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:50,533 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:50,533 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:50,537 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:50,537 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:50,540 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:50,541 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~m=0} Honda state: {ackermann_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:50,560 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:50,560 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:50,569 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:50,570 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret2=0} Honda state: {ackermann_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:50,589 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:50,589 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:50,591 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:50,591 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~m~0=0} Honda state: {ULTIMATE.start_main_~m~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:50,611 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:50,611 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:50,614 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:50,614 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret0=0} Honda state: {ackermann_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:50,634 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:50,634 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:50,639 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:50,639 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret1=0} Honda state: {ackermann_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:50,659 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:50,659 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:50,662 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:50,662 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~m=0} Honda state: {ackermann_#in~m=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:50,681 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:50,681 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:50,691 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:50,691 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret5=0} Honda state: {ULTIMATE.start_main_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:50,712 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:50,712 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:50,716 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:50,716 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_#t~ret6=0} Honda state: {ULTIMATE.start_#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:50,736 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:50,736 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:50,738 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:50,738 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~result~0=0} Honda state: {ULTIMATE.start_main_~result~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:50,758 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:50,758 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:50,761 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:50,761 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:50,781 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:50,781 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:50,784 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:50,784 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~n~0=0} Honda state: {ULTIMATE.start_main_~n~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:50,822 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:50,822 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:50,841 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:50,841 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:53:50,873 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:50,873 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 109 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:50,882 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:50,882 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4=0} Honda state: {ULTIMATE.start_main_#t~nondet4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:50,901 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:50,901 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:50,924 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:53:50,924 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:50,945 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:53:50,946 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:50,946 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:50,946 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:50,946 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:50,947 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:53:50,947 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:50,947 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:50,947 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:50,947 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ackermann02_false-unreach-call_true-no-overflow_true-termination.c_Iteration8_Lasso [2019-01-01 23:53:50,947 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:50,947 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:50,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:50,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:51,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:51,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:51,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:51,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:51,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:51,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:51,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:51,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:51,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:51,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:51,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:51,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:51,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:51,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:51,338 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:51,338 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:53:51,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:51,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:51,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:51,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:51,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:51,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:51,340 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:51,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:51,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:51,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:51,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:51,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:51,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:51,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:51,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:51,342 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:51,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:51,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:51,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:51,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:51,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:51,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:51,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:51,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:51,344 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:51,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:51,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:51,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:51,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:51,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:51,345 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:53:51,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:51,347 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-01-01 23:53:51,347 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-01 23:53:51,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:51,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:51,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:51,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:51,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:51,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:51,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:51,357 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:51,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:51,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:51,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:51,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:51,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:51,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:51,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:51,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:51,359 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:51,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:51,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:51,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:51,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:51,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:51,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:51,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:51,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:51,360 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:51,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:51,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:51,361 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:51,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:51,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:51,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:51,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:51,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:51,362 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:51,362 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:51,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:51,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:51,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:51,363 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:51,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:51,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:51,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:51,364 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:51,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:51,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:51,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:51,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:51,365 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:51,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:51,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:51,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:51,365 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:51,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:51,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:51,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:51,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:51,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:51,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:51,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:51,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:51,367 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:51,367 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:51,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:51,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:51,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:51,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:51,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:51,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:51,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:51,369 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:51,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:51,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:51,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:51,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:51,370 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:51,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:51,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:51,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:51,371 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:51,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:51,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:51,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:51,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:51,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:51,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:51,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:51,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:51,372 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:51,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:51,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:51,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:51,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:51,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:51,374 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:53:51,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:51,376 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-01-01 23:53:51,376 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-01 23:53:51,388 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:53:51,397 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 23:53:51,398 INFO L444 ModelExtractionUtils]: 5 out of 11 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-01 23:53:51,398 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:53:51,399 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2019-01-01 23:53:51,400 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:53:51,400 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ackermann_#in~n) = 1*ackermann_#in~n Supporting invariants [1*ackermann_#in~n >= 0] [2019-01-01 23:53:51,448 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 23:53:51,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:52,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:52,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:52,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:52,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:52,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:53:52,562 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.13 stem predicates 3 loop predicates [2019-01-01 23:53:52,562 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 212 states and 268 transitions. cyclomatic complexity: 63 Second operand 16 states. [2019-01-01 23:53:52,679 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 212 states and 268 transitions. cyclomatic complexity: 63. Second operand 16 states. Result 221 states and 282 transitions. Complement of second has 7 states. [2019-01-01 23:53:52,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2019-01-01 23:53:52,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-01 23:53:52,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-01-01 23:53:52,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 47 letters. Loop has 4 letters. [2019-01-01 23:53:52,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:52,687 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:53:52,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:52,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:52,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:53,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:53,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:53,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:53:53,184 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.13 stem predicates 3 loop predicates [2019-01-01 23:53:53,184 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 212 states and 268 transitions. cyclomatic complexity: 63 Second operand 16 states. [2019-01-01 23:53:53,301 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 212 states and 268 transitions. cyclomatic complexity: 63. Second operand 16 states. Result 221 states and 282 transitions. Complement of second has 7 states. [2019-01-01 23:53:53,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2019-01-01 23:53:53,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-01 23:53:53,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-01-01 23:53:53,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 47 letters. Loop has 4 letters. [2019-01-01 23:53:53,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:53,306 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:53:53,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:53,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:53,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:53,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:53,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:53:53,893 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.13 stem predicates 3 loop predicates [2019-01-01 23:53:53,893 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 212 states and 268 transitions. cyclomatic complexity: 63 Second operand 16 states. [2019-01-01 23:53:55,614 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 212 states and 268 transitions. cyclomatic complexity: 63. Second operand 16 states. Result 506 states and 647 transitions. Complement of second has 68 states. [2019-01-01 23:53:55,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 25 states 20 stem states 2 non-accepting loop states 2 accepting loop states [2019-01-01 23:53:55,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-01 23:53:55,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 72 transitions. [2019-01-01 23:53:55,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 72 transitions. Stem has 47 letters. Loop has 4 letters. [2019-01-01 23:53:55,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:55,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 72 transitions. Stem has 51 letters. Loop has 4 letters. [2019-01-01 23:53:55,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:55,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 72 transitions. Stem has 47 letters. Loop has 8 letters. [2019-01-01 23:53:55,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:55,618 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 506 states and 647 transitions. [2019-01-01 23:53:55,632 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-01 23:53:55,637 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 506 states to 331 states and 405 transitions. [2019-01-01 23:53:55,639 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 266 [2019-01-01 23:53:55,639 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 270 [2019-01-01 23:53:55,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 331 states and 405 transitions. [2019-01-01 23:53:55,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:53:55,647 INFO L705 BuchiCegarLoop]: Abstraction has 331 states and 405 transitions. [2019-01-01 23:53:55,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states and 405 transitions. [2019-01-01 23:53:55,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 293. [2019-01-01 23:53:55,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-01-01 23:53:55,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 360 transitions. [2019-01-01 23:53:55,675 INFO L728 BuchiCegarLoop]: Abstraction has 293 states and 360 transitions. [2019-01-01 23:53:55,675 INFO L608 BuchiCegarLoop]: Abstraction has 293 states and 360 transitions. [2019-01-01 23:53:55,675 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-01 23:53:55,675 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 293 states and 360 transitions. [2019-01-01 23:53:55,681 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-01 23:53:55,681 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:53:55,681 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:53:55,682 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 7, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 23:53:55,682 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2019-01-01 23:53:55,683 INFO L794 eck$LassoCheckResult]: Stem: 5855#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; 5821#L27 assume !(main_~m~0 < 0 || main_~m~0 > 3);main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; 5822#L33 assume !(main_~n~0 < 0 || main_~n~0 > 23); 5829#L39 call main_#t~ret5 := ackermann(main_~m~0, main_~n~0);< 5830#ackermannENTRY ~m := #in~m;~n := #in~n; 5878#L15 assume !(0 == ~m); 5877#L18 assume 0 == ~n; 5871#L19 call #t~ret0 := ackermann(~m - 1, 1);< 5876#ackermannENTRY ~m := #in~m;~n := #in~n; 5874#L15 assume !(0 == ~m); 5875#L18 assume !(0 == ~n); 5839#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 5873#ackermannENTRY ~m := #in~m;~n := #in~n; 5866#L15 assume !(0 == ~m); 5868#L18 assume 0 == ~n; 5838#L19 call #t~ret0 := ackermann(~m - 1, 1);< 5840#ackermannENTRY ~m := #in~m;~n := #in~n; 5948#L15 assume !(0 == ~m); 5946#L18 assume !(0 == ~n); 5941#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 5942#ackermannENTRY ~m := #in~m;~n := #in~n; 5959#L15 assume !(0 == ~m); 5955#L18 assume 0 == ~n; 5950#L19 call #t~ret0 := ackermann(~m - 1, 1);< 5953#ackermannENTRY ~m := #in~m;~n := #in~n; 5962#L15 assume 0 == ~m;#res := 1 + ~n; 5956#ackermannFINAL assume true; 5949#ackermannEXIT >#42#return; 5947#L19-1 #res := #t~ret0;havoc #t~ret0; 5945#ackermannFINAL assume true; 5940#ackermannEXIT >#44#return; 5937#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 5938#ackermannENTRY ~m := #in~m;~n := #in~n; 5943#L15 assume 0 == ~m;#res := 1 + ~n; 5939#ackermannFINAL assume true; 5936#ackermannEXIT >#46#return; 5935#L21-2 #res := #t~ret2;havoc #t~ret1;havoc #t~ret2; 5932#ackermannFINAL assume true; 5931#ackermannEXIT >#42#return; 5911#L19-1 #res := #t~ret0;havoc #t~ret0; 5909#ackermannFINAL assume true; 5898#ackermannEXIT >#44#return; 5899#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 5981#ackermannENTRY ~m := #in~m;~n := #in~n; 5988#L15 assume !(0 == ~m); 5989#L18 assume !(0 == ~n); 6011#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 5825#ackermannENTRY ~m := #in~m;~n := #in~n; 6066#L15 assume !(0 == ~m); 6060#L18 assume 0 == ~n; 6056#L19 call #t~ret0 := ackermann(~m - 1, 1);< 5837#ackermannENTRY [2019-01-01 23:53:55,686 INFO L796 eck$LassoCheckResult]: Loop: 5837#ackermannENTRY ~m := #in~m;~n := #in~n; 6061#L15 assume !(0 == ~m); 6062#L18 assume !(0 == ~n); 5836#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 6070#ackermannENTRY ~m := #in~m;~n := #in~n; 6067#L15 assume !(0 == ~m); 6065#L18 assume 0 == ~n; 5835#L19 call #t~ret0 := ackermann(~m - 1, 1);< 5837#ackermannENTRY [2019-01-01 23:53:55,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:55,686 INFO L82 PathProgramCache]: Analyzing trace with hash -997228084, now seen corresponding path program 3 times [2019-01-01 23:53:55,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:55,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:55,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:55,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:53:55,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:55,896 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 55 proven. 19 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-01-01 23:53:55,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:53:55,897 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:53:55,916 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 23:53:55,943 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-01 23:53:55,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 23:53:55,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:55,956 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 55 proven. 19 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-01-01 23:53:55,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:53:55,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2019-01-01 23:53:55,981 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:53:55,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:55,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1459432636, now seen corresponding path program 2 times [2019-01-01 23:53:55,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:55,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:55,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:55,982 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:53:55,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:55,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:56,170 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:56,170 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:56,170 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:56,170 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:56,170 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:53:56,170 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:56,170 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:56,170 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:56,171 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ackermann02_false-unreach-call_true-no-overflow_true-termination.c_Iteration9_Loop [2019-01-01 23:53:56,171 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:56,171 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:56,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:56,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:56,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:56,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:56,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:56,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:56,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:56,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:56,312 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:56,312 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:56,316 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:56,316 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:56,319 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:56,319 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret2=0} Honda state: {ackermann_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:56,338 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:56,339 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:56,342 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:56,342 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret0=0} Honda state: {ackermann_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:56,362 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:56,362 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:56,365 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:56,365 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret1=0} Honda state: {ackermann_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:56,385 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:56,385 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:56,395 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:56,395 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~m=0} Honda state: {ackermann_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 117 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:56,416 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:56,416 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:56,420 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:56,420 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~n=1} Honda state: {ackermann_#in~n=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:56,440 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:56,441 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:56,444 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:56,444 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=0} Honda state: {ackermann_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:56,466 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:56,466 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 120 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:56,489 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:53:56,489 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:56,501 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:56,501 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~m=-8} Honda state: {ackermann_#in~m=-8} Generalized eigenvectors: [{ackermann_#in~m=0}, {ackermann_#in~m=0}, {ackermann_#in~m=-1}] Lambdas: [15, 0, 1] Nus: [0, 0] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:56,521 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:56,521 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:56,524 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:56,524 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2019-01-01 23:53:56,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-01 23:53:56,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-01-01 23:53:56,541 INFO L87 Difference]: Start difference. First operand 293 states and 360 transitions. cyclomatic complexity: 74 Second operand 15 states. [2019-01-01 23:53:57,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:53:57,209 INFO L93 Difference]: Finished difference Result 301 states and 365 transitions. [2019-01-01 23:53:57,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-01 23:53:57,210 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 301 states and 365 transitions. [2019-01-01 23:53:57,213 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-01 23:53:57,216 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 301 states to 297 states and 361 transitions. [2019-01-01 23:53:57,216 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 236 [2019-01-01 23:53:57,217 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 236 [2019-01-01 23:53:57,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 297 states and 361 transitions. [2019-01-01 23:53:57,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:53:57,217 INFO L705 BuchiCegarLoop]: Abstraction has 297 states and 361 transitions. [2019-01-01 23:53:57,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states and 361 transitions. [2019-01-01 23:53:57,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 277. [2019-01-01 23:53:57,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-01-01 23:53:57,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 339 transitions. [2019-01-01 23:53:57,229 INFO L728 BuchiCegarLoop]: Abstraction has 277 states and 339 transitions. [2019-01-01 23:53:57,230 INFO L608 BuchiCegarLoop]: Abstraction has 277 states and 339 transitions. [2019-01-01 23:53:57,230 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-01 23:53:57,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 277 states and 339 transitions. [2019-01-01 23:53:57,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-01 23:53:57,232 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:53:57,232 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:53:57,233 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 8, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 23:53:57,233 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2019-01-01 23:53:57,233 INFO L794 eck$LassoCheckResult]: Stem: 6665#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; 6625#L27 assume !(main_~m~0 < 0 || main_~m~0 > 3);main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; 6626#L33 assume !(main_~n~0 < 0 || main_~n~0 > 23); 6635#L39 call main_#t~ret5 := ackermann(main_~m~0, main_~n~0);< 6636#ackermannENTRY ~m := #in~m;~n := #in~n; 6683#L15 assume !(0 == ~m); 6682#L18 assume 0 == ~n; 6679#L19 call #t~ret0 := ackermann(~m - 1, 1);< 6681#ackermannENTRY ~m := #in~m;~n := #in~n; 6677#L15 assume !(0 == ~m); 6680#L18 assume !(0 == ~n); 6672#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 6675#ackermannENTRY ~m := #in~m;~n := #in~n; 6673#L15 assume !(0 == ~m); 6671#L18 assume 0 == ~n; 6654#L19 call #t~ret0 := ackermann(~m - 1, 1);< 6648#ackermannENTRY ~m := #in~m;~n := #in~n; 6656#L15 assume !(0 == ~m); 6669#L18 assume !(0 == ~n); 6638#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 6722#ackermannENTRY ~m := #in~m;~n := #in~n; 6723#L15 assume !(0 == ~m); 6717#L18 assume 0 == ~n; 6718#L19 call #t~ret0 := ackermann(~m - 1, 1);< 6644#ackermannENTRY ~m := #in~m;~n := #in~n; 6817#L15 assume 0 == ~m;#res := 1 + ~n; 6816#ackermannFINAL assume true; 6814#ackermannEXIT >#42#return; 6813#L19-1 #res := #t~ret0;havoc #t~ret0; 6812#ackermannFINAL assume true; 6809#ackermannEXIT >#44#return; 6807#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 6808#ackermannENTRY ~m := #in~m;~n := #in~n; 6811#L15 assume 0 == ~m;#res := 1 + ~n; 6810#ackermannFINAL assume true; 6806#ackermannEXIT >#46#return; 6805#L21-2 #res := #t~ret2;havoc #t~ret1;havoc #t~ret2; 6804#ackermannFINAL assume true; 6747#ackermannEXIT >#42#return; 6742#L19-1 #res := #t~ret0;havoc #t~ret0; 6740#ackermannFINAL assume true; 6729#ackermannEXIT >#44#return; 6628#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 6698#ackermannENTRY ~m := #in~m;~n := #in~n; 6692#L15 assume !(0 == ~m); 6691#L18 assume !(0 == ~n); 6627#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 6629#ackermannENTRY ~m := #in~m;~n := #in~n; 6710#L15 assume !(0 == ~m); 6706#L18 assume !(0 == ~n); 6662#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 6704#ackermannENTRY ~m := #in~m;~n := #in~n; 6702#L15 assume !(0 == ~m); 6703#L18 assume 0 == ~n; 6631#L19 call #t~ret0 := ackermann(~m - 1, 1);< 6716#ackermannENTRY [2019-01-01 23:53:57,233 INFO L796 eck$LassoCheckResult]: Loop: 6716#ackermannENTRY ~m := #in~m;~n := #in~n; 6711#L15 assume !(0 == ~m); 6657#L18 assume !(0 == ~n); 6630#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 6634#ackermannENTRY ~m := #in~m;~n := #in~n; 6700#L15 assume !(0 == ~m); 6699#L18 assume 0 == ~n; 6632#L19 call #t~ret0 := ackermann(~m - 1, 1);< 6716#ackermannENTRY [2019-01-01 23:53:57,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:57,234 INFO L82 PathProgramCache]: Analyzing trace with hash 258460313, now seen corresponding path program 4 times [2019-01-01 23:53:57,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:57,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:57,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:57,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:53:57,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:57,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:57,468 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 74 proven. 28 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-01-01 23:53:57,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:53:57,468 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:53:57,482 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 23:53:57,502 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 23:53:57,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 23:53:57,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:57,515 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 74 proven. 28 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-01-01 23:53:57,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:53:57,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2019-01-01 23:53:57,538 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:53:57,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:57,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1459432636, now seen corresponding path program 3 times [2019-01-01 23:53:57,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:57,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:57,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:57,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:53:57,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:57,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:57,679 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:57,679 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:57,680 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:57,680 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:57,680 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:53:57,680 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:57,680 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:57,680 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:57,680 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ackermann02_false-unreach-call_true-no-overflow_true-termination.c_Iteration10_Loop [2019-01-01 23:53:57,681 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:57,681 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:57,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:57,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:57,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:57,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:57,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:57,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:57,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:57,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:57,761 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:57,761 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 123 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:57,766 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:57,766 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:57,769 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:57,769 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret0=0} Honda state: {ackermann_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 124 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:53:57,789 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:57,789 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 124 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:57,791 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:57,791 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~m=0} Honda state: {ackermann_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 125 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:57,811 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:57,811 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:57,814 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:57,814 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret2=0} Honda state: {ackermann_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 126 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:57,834 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:57,834 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:57,837 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:57,837 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 127 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:57,857 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:57,857 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:57,860 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:57,860 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~n=1} Honda state: {ackermann_#in~n=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 128 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:57,882 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:57,882 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:57,885 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:57,885 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret1=0} Honda state: {ackermann_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 129 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:57,907 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:57,907 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:57,910 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:57,910 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=0} Honda state: {ackermann_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 130 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 130 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:57,931 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:57,931 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 131 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 131 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:57,954 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:53:57,954 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:58,013 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:58,014 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~m=-8} Honda state: {ackermann_#in~m=-8} Generalized eigenvectors: [{ackermann_#in~m=0}, {ackermann_#in~m=-1}, {ackermann_#in~m=0}] Lambdas: [0, 1, 8] Nus: [0, 0] [2019-01-01 23:53:58,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-01 23:53:58,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-01-01 23:53:58,031 INFO L87 Difference]: Start difference. First operand 277 states and 339 transitions. cyclomatic complexity: 69 Second operand 17 states. [2019-01-01 23:53:58,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:53:58,843 INFO L93 Difference]: Finished difference Result 322 states and 390 transitions. [2019-01-01 23:53:58,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-01 23:53:58,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 322 states and 390 transitions. [2019-01-01 23:53:58,851 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-01 23:53:58,856 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 322 states to 318 states and 386 transitions. [2019-01-01 23:53:58,856 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 248 [2019-01-01 23:53:58,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 248 [2019-01-01 23:53:58,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 318 states and 386 transitions. [2019-01-01 23:53:58,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:53:58,857 INFO L705 BuchiCegarLoop]: Abstraction has 318 states and 386 transitions. [2019-01-01 23:53:58,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states and 386 transitions. [2019-01-01 23:53:58,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 304. [2019-01-01 23:53:58,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-01-01 23:53:58,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 372 transitions. [2019-01-01 23:53:58,874 INFO L728 BuchiCegarLoop]: Abstraction has 304 states and 372 transitions. [2019-01-01 23:53:58,874 INFO L608 BuchiCegarLoop]: Abstraction has 304 states and 372 transitions. [2019-01-01 23:53:58,874 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-01 23:53:58,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 304 states and 372 transitions. [2019-01-01 23:53:58,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-01 23:53:58,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:53:58,882 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:53:58,883 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 9, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 23:53:58,883 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2019-01-01 23:53:58,883 INFO L794 eck$LassoCheckResult]: Stem: 7494#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; 7456#L27 assume !(main_~m~0 < 0 || main_~m~0 > 3);main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; 7457#L33 assume !(main_~n~0 < 0 || main_~n~0 > 23); 7465#L39 call main_#t~ret5 := ackermann(main_~m~0, main_~n~0);< 7466#ackermannENTRY ~m := #in~m;~n := #in~n; 7515#L15 assume !(0 == ~m); 7516#L18 assume 0 == ~n; 7506#L19 call #t~ret0 := ackermann(~m - 1, 1);< 7511#ackermannENTRY ~m := #in~m;~n := #in~n; 7509#L15 assume !(0 == ~m); 7510#L18 assume !(0 == ~n); 7479#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 7508#ackermannENTRY ~m := #in~m;~n := #in~n; 7500#L15 assume !(0 == ~m); 7499#L18 assume 0 == ~n; 7468#L19 call #t~ret0 := ackermann(~m - 1, 1);< 7480#ackermannENTRY ~m := #in~m;~n := #in~n; 7543#L15 assume !(0 == ~m); 7544#L18 assume !(0 == ~n); 7473#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 7540#ackermannENTRY ~m := #in~m;~n := #in~n; 7541#L15 assume !(0 == ~m); 7535#L18 assume 0 == ~n; 7536#L19 call #t~ret0 := ackermann(~m - 1, 1);< 7478#ackermannENTRY ~m := #in~m;~n := #in~n; 7688#L15 assume 0 == ~m;#res := 1 + ~n; 7685#ackermannFINAL assume true; 7678#ackermannEXIT >#42#return; 7677#L19-1 #res := #t~ret0;havoc #t~ret0; 7676#ackermannFINAL assume true; 7675#ackermannEXIT >#44#return; 7641#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 7642#ackermannENTRY ~m := #in~m;~n := #in~n; 7674#L15 assume 0 == ~m;#res := 1 + ~n; 7673#ackermannFINAL assume true; 7640#ackermannEXIT >#46#return; 7637#L21-2 #res := #t~ret2;havoc #t~ret1;havoc #t~ret2; 7634#ackermannFINAL assume true; 7625#ackermannEXIT >#42#return; 7626#L19-1 #res := #t~ret0;havoc #t~ret0; 7631#ackermannFINAL assume true; 7572#ackermannEXIT >#44#return; 7459#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 7528#ackermannENTRY ~m := #in~m;~n := #in~n; 7525#L15 assume !(0 == ~m); 7527#L18 assume !(0 == ~n); 7458#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 7460#ackermannENTRY ~m := #in~m;~n := #in~n; 7580#L15 assume !(0 == ~m); 7579#L18 assume !(0 == ~n); 7461#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 7464#ackermannENTRY ~m := #in~m;~n := #in~n; 7482#L15 assume !(0 == ~m); 7496#L18 assume !(0 == ~n); 7547#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 7557#ackermannENTRY ~m := #in~m;~n := #in~n; 7546#L15 assume !(0 == ~m); 7549#L18 assume 0 == ~n; 7487#L19 call #t~ret0 := ackermann(~m - 1, 1);< 7534#ackermannENTRY [2019-01-01 23:53:58,888 INFO L796 eck$LassoCheckResult]: Loop: 7534#ackermannENTRY ~m := #in~m;~n := #in~n; 7530#L15 assume !(0 == ~m); 7486#L18 assume !(0 == ~n); 7490#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 7558#ackermannENTRY ~m := #in~m;~n := #in~n; 7550#L15 assume !(0 == ~m); 7529#L18 assume 0 == ~n; 7489#L19 call #t~ret0 := ackermann(~m - 1, 1);< 7534#ackermannENTRY [2019-01-01 23:53:58,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:58,888 INFO L82 PathProgramCache]: Analyzing trace with hash 807724262, now seen corresponding path program 5 times [2019-01-01 23:53:58,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:58,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:58,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:58,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:53:58,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:58,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:58,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1459432636, now seen corresponding path program 4 times [2019-01-01 23:53:58,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:58,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:58,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:58,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:53:58,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:58,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:58,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:58,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1221239647, now seen corresponding path program 6 times [2019-01-01 23:53:58,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:58,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:58,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:58,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:53:58,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:58,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:59,244 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 131 proven. 83 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-01-01 23:53:59,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:53:59,244 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:53:59,255 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 23:53:59,287 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-01-01 23:53:59,287 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 23:53:59,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:59,368 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 128 proven. 70 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-01-01 23:53:59,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:53:59,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9] total 18 [2019-01-01 23:53:59,510 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:59,510 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:59,511 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:59,511 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:59,511 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:53:59,511 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:59,511 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:59,511 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:59,511 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ackermann02_false-unreach-call_true-no-overflow_true-termination.c_Iteration11_Loop [2019-01-01 23:53:59,512 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:59,512 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:59,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:59,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:59,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:59,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:59,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:59,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:59,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:59,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:59,616 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:59,617 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 133 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 133 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:59,622 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:59,622 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:59,625 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:59,625 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=0} Honda state: {ackermann_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 134 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 134 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:59,646 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:59,646 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:59,650 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:59,650 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret2=0} Honda state: {ackermann_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 135 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 135 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:59,672 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:59,672 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:59,675 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:59,675 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~m=0} Honda state: {ackermann_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 136 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 136 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:59,695 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:59,695 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:59,697 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:59,698 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret0=0} Honda state: {ackermann_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 137 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 137 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:59,718 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:59,719 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:59,721 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:59,722 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~n=1} Honda state: {ackermann_#in~n=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 138 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 138 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:59,742 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:59,742 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:59,745 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:59,745 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret1=0} Honda state: {ackermann_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 139 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 139 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:59,767 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:59,767 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:59,776 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:59,776 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 140 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 140 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:59,797 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:59,797 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 141 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:53:59,819 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:53:59,819 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 141 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:59,831 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:59,831 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~m=-8} Honda state: {ackermann_#in~m=-8} Generalized eigenvectors: [{ackermann_#in~m=0}, {ackermann_#in~m=0}, {ackermann_#in~m=-1}] Lambdas: [15, 0, 1] Nus: [0, 0] [2019-01-01 23:53:59,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-01 23:53:59,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2019-01-01 23:53:59,850 INFO L87 Difference]: Start difference. First operand 304 states and 372 transitions. cyclomatic complexity: 75 Second operand 18 states. [2019-01-01 23:54:00,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:54:00,321 INFO L93 Difference]: Finished difference Result 341 states and 411 transitions. [2019-01-01 23:54:00,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-01 23:54:00,323 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 341 states and 411 transitions. [2019-01-01 23:54:00,328 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-01 23:54:00,330 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 341 states to 241 states and 286 transitions. [2019-01-01 23:54:00,330 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 172 [2019-01-01 23:54:00,331 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 172 [2019-01-01 23:54:00,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 241 states and 286 transitions. [2019-01-01 23:54:00,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:54:00,332 INFO L705 BuchiCegarLoop]: Abstraction has 241 states and 286 transitions. [2019-01-01 23:54:00,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states and 286 transitions. [2019-01-01 23:54:00,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2019-01-01 23:54:00,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-01-01 23:54:00,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 286 transitions. [2019-01-01 23:54:00,339 INFO L728 BuchiCegarLoop]: Abstraction has 241 states and 286 transitions. [2019-01-01 23:54:00,339 INFO L608 BuchiCegarLoop]: Abstraction has 241 states and 286 transitions. [2019-01-01 23:54:00,339 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-01 23:54:00,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 241 states and 286 transitions. [2019-01-01 23:54:00,341 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-01 23:54:00,341 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:54:00,341 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:54:00,343 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [22, 16, 15, 10, 10, 6, 6, 6, 6, 6, 5, 5, 4, 4, 1, 1, 1, 1] [2019-01-01 23:54:00,343 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2019-01-01 23:54:00,343 INFO L794 eck$LassoCheckResult]: Stem: 8379#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; 8345#L27 assume !(main_~m~0 < 0 || main_~m~0 > 3);main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; 8346#L33 assume !(main_~n~0 < 0 || main_~n~0 > 23); 8353#L39 call main_#t~ret5 := ackermann(main_~m~0, main_~n~0);< 8354#ackermannENTRY ~m := #in~m;~n := #in~n; 8405#L15 assume !(0 == ~m); 8585#L18 assume !(0 == ~n); 8373#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 8402#ackermannENTRY ~m := #in~m;~n := #in~n; 8401#L15 assume !(0 == ~m); 8400#L18 assume 0 == ~n; 8397#L19 call #t~ret0 := ackermann(~m - 1, 1);< 8399#ackermannENTRY ~m := #in~m;~n := #in~n; 8396#L15 assume !(0 == ~m); 8398#L18 assume !(0 == ~n); 8365#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 8502#ackermannENTRY ~m := #in~m;~n := #in~n; 8571#L15 assume !(0 == ~m); 8389#L18 assume 0 == ~n; 8364#L19 call #t~ret0 := ackermann(~m - 1, 1);< 8366#ackermannENTRY ~m := #in~m;~n := #in~n; 8457#L15 assume !(0 == ~m); 8455#L18 assume !(0 == ~n); 8452#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 8453#ackermannENTRY ~m := #in~m;~n := #in~n; 8468#L15 assume !(0 == ~m); 8467#L18 assume 0 == ~n; 8464#L19 call #t~ret0 := ackermann(~m - 1, 1);< 8426#ackermannENTRY ~m := #in~m;~n := #in~n; 8475#L15 assume 0 == ~m;#res := 1 + ~n; 8473#ackermannFINAL assume true; 8463#ackermannEXIT >#42#return; 8460#L19-1 #res := #t~ret0;havoc #t~ret0; 8458#ackermannFINAL assume true; 8451#ackermannEXIT >#44#return; 8439#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 8440#ackermannENTRY ~m := #in~m;~n := #in~n; 8450#L15 assume 0 == ~m;#res := 1 + ~n; 8449#ackermannFINAL assume true; 8438#ackermannEXIT >#46#return; 8434#L21-2 #res := #t~ret2;havoc #t~ret1;havoc #t~ret2; 8430#ackermannFINAL assume true; 8416#ackermannEXIT >#42#return; 8418#L19-1 #res := #t~ret0;havoc #t~ret0; 8520#ackermannFINAL assume true; 8501#ackermannEXIT >#44#return; 8445#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 8446#ackermannENTRY ~m := #in~m;~n := #in~n; 8539#L15 assume !(0 == ~m); 8534#L18 assume !(0 == ~n); 8496#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 8498#ackermannENTRY ~m := #in~m;~n := #in~n; 8562#L15 assume !(0 == ~m); 8561#L18 assume !(0 == ~n); 8541#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 8542#ackermannENTRY ~m := #in~m;~n := #in~n; 8556#L15 assume !(0 == ~m); 8555#L18 assume !(0 == ~n); 8359#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 8552#ackermannENTRY ~m := #in~m;~n := #in~n; 8551#L15 assume !(0 == ~m); 8550#L18 assume 0 == ~n; 8413#L19 call #t~ret0 := ackermann(~m - 1, 1);< 8472#ackermannENTRY ~m := #in~m;~n := #in~n; 8474#L15 assume 0 == ~m;#res := 1 + ~n; 8471#ackermannFINAL assume true; 8411#ackermannEXIT >#42#return; 8415#L19-1 #res := #t~ret0;havoc #t~ret0; 8549#ackermannFINAL assume true; 8547#ackermannEXIT >#44#return; 8545#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 8360#ackermannENTRY ~m := #in~m;~n := #in~n; 8565#L15 assume 0 == ~m;#res := 1 + ~n; 8564#ackermannFINAL assume true; 8543#ackermannEXIT >#46#return; 8536#L21-2 #res := #t~ret2;havoc #t~ret1;havoc #t~ret2; 8554#ackermannFINAL assume true; 8540#ackermannEXIT >#44#return; 8383#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 8538#ackermannENTRY ~m := #in~m;~n := #in~n; 8380#L15 assume 0 == ~m;#res := 1 + ~n; 8385#ackermannFINAL assume true; 8535#ackermannEXIT >#46#return; 8533#L21-2 #res := #t~ret2;havoc #t~ret1;havoc #t~ret2; 8522#ackermannFINAL assume true; 8495#ackermannEXIT >#44#return; 8491#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 8494#ackermannENTRY ~m := #in~m;~n := #in~n; 8512#L15 assume 0 == ~m;#res := 1 + ~n; 8511#ackermannFINAL assume true; 8489#ackermannEXIT >#46#return; 8487#L21-2 #res := #t~ret2;havoc #t~ret1;havoc #t~ret2; 8485#ackermannFINAL assume true; 8444#ackermannEXIT >#46#return; 8436#L21-2 #res := #t~ret2;havoc #t~ret1;havoc #t~ret2; 8432#ackermannFINAL assume true; 8422#ackermannEXIT >#42#return; 8372#L19-1 #res := #t~ret0;havoc #t~ret0; 8375#ackermannFINAL assume true; 8581#ackermannEXIT >#44#return; 8349#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 8410#ackermannENTRY ~m := #in~m;~n := #in~n; 8408#L15 assume !(0 == ~m); 8409#L18 assume !(0 == ~n); 8347#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 8350#ackermannENTRY ~m := #in~m;~n := #in~n; 8370#L15 assume !(0 == ~m); 8386#L18 assume !(0 == ~n); 8351#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 8352#ackermannENTRY ~m := #in~m;~n := #in~n; 8371#L15 assume !(0 == ~m); 8575#L18 assume !(0 == ~n); 8427#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 8447#ackermannENTRY ~m := #in~m;~n := #in~n; 8437#L15 assume !(0 == ~m); 8433#L18 assume 0 == ~n; 8421#L19 call #t~ret0 := ackermann(~m - 1, 1);< 8429#ackermannENTRY ~m := #in~m;~n := #in~n; 8488#L15 assume !(0 == ~m); 8486#L18 assume !(0 == ~n); 8482#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 8484#ackermannENTRY ~m := #in~m;~n := #in~n; 8514#L15 assume !(0 == ~m); 8513#L18 assume 0 == ~n; 8412#L19 call #t~ret0 := ackermann(~m - 1, 1);< 8363#ackermannENTRY [2019-01-01 23:54:00,343 INFO L796 eck$LassoCheckResult]: Loop: 8363#ackermannENTRY ~m := #in~m;~n := #in~n; 8500#L15 assume !(0 == ~m); 8470#L18 assume !(0 == ~n); 8362#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 8466#ackermannENTRY ~m := #in~m;~n := #in~n; 8461#L15 assume !(0 == ~m); 8459#L18 assume 0 == ~n; 8361#L19 call #t~ret0 := ackermann(~m - 1, 1);< 8363#ackermannENTRY [2019-01-01 23:54:00,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:00,343 INFO L82 PathProgramCache]: Analyzing trace with hash 286526941, now seen corresponding path program 7 times [2019-01-01 23:54:00,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:00,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:00,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:00,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:54:00,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:00,719 INFO L134 CoverageAnalysis]: Checked inductivity of 883 backedges. 495 proven. 85 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2019-01-01 23:54:00,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:54:00,719 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:54:00,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:00,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:00,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:00,807 INFO L134 CoverageAnalysis]: Checked inductivity of 883 backedges. 495 proven. 85 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2019-01-01 23:54:00,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:54:00,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2019-01-01 23:54:00,829 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:54:00,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:00,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1459432636, now seen corresponding path program 5 times [2019-01-01 23:54:00,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:00,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:00,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:00,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:00,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:00,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:00,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:00,976 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:54:00,976 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:54:00,976 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:54:00,976 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:54:00,976 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:54:00,977 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:00,977 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:54:00,977 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:54:00,977 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ackermann02_false-unreach-call_true-no-overflow_true-termination.c_Iteration12_Loop [2019-01-01 23:54:00,977 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:54:00,977 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:54:00,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:00,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:00,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:00,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:00,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:01,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:01,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:01,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:01,057 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:54:01,057 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 143 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 143 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:01,062 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:01,062 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:01,066 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:01,066 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret2=0} Honda state: {ackermann_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 144 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 144 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:01,086 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:01,087 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:01,089 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:01,089 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret0=0} Honda state: {ackermann_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 145 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 145 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:01,109 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:01,110 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:01,112 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:01,112 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret1=0} Honda state: {ackermann_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 146 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 146 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:01,132 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:01,132 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:01,134 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:01,134 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=0} Honda state: {ackermann_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 147 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 147 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:01,154 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:01,154 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:01,157 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:01,157 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~n=1} Honda state: {ackermann_#in~n=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 148 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 148 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:01,177 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:01,177 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:01,180 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:01,180 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~m=0} Honda state: {ackermann_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 149 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 149 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:01,203 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:01,203 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:01,207 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:01,207 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 150 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 150 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:01,227 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:01,227 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 151 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 151 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:01,252 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:54:01,253 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:01,266 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:01,266 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~m=-8} Honda state: {ackermann_#in~m=-8} Generalized eigenvectors: [{ackermann_#in~m=0}, {ackermann_#in~m=0}, {ackermann_#in~m=-1}] Lambdas: [15, 0, 1] Nus: [0, 0] [2019-01-01 23:54:01,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-01 23:54:01,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2019-01-01 23:54:01,284 INFO L87 Difference]: Start difference. First operand 241 states and 286 transitions. cyclomatic complexity: 52 Second operand 25 states. [2019-01-01 23:54:03,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:54:03,180 INFO L93 Difference]: Finished difference Result 396 states and 482 transitions. [2019-01-01 23:54:03,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-01 23:54:03,183 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 396 states and 482 transitions. [2019-01-01 23:54:03,187 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-01 23:54:03,192 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 396 states to 392 states and 478 transitions. [2019-01-01 23:54:03,192 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 308 [2019-01-01 23:54:03,192 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 308 [2019-01-01 23:54:03,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 392 states and 478 transitions. [2019-01-01 23:54:03,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:54:03,198 INFO L705 BuchiCegarLoop]: Abstraction has 392 states and 478 transitions. [2019-01-01 23:54:03,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states and 478 transitions. [2019-01-01 23:54:03,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 347. [2019-01-01 23:54:03,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-01-01 23:54:03,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 420 transitions. [2019-01-01 23:54:03,213 INFO L728 BuchiCegarLoop]: Abstraction has 347 states and 420 transitions. [2019-01-01 23:54:03,214 INFO L608 BuchiCegarLoop]: Abstraction has 347 states and 420 transitions. [2019-01-01 23:54:03,214 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2019-01-01 23:54:03,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 347 states and 420 transitions. [2019-01-01 23:54:03,220 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-01 23:54:03,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:54:03,220 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:54:03,223 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [23, 17, 15, 11, 11, 6, 6, 6, 6, 6, 5, 5, 4, 4, 1, 1, 1, 1] [2019-01-01 23:54:03,224 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2019-01-01 23:54:03,224 INFO L794 eck$LassoCheckResult]: Stem: 9525#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; 9486#L27 assume !(main_~m~0 < 0 || main_~m~0 > 3);main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; 9487#L33 assume !(main_~n~0 < 0 || main_~n~0 > 23); 9496#L39 call main_#t~ret5 := ackermann(main_~m~0, main_~n~0);< 9497#ackermannENTRY ~m := #in~m;~n := #in~n; 9551#L15 assume !(0 == ~m); 9552#L18 assume !(0 == ~n); 9545#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 9548#ackermannENTRY ~m := #in~m;~n := #in~n; 9547#L15 assume !(0 == ~m); 9546#L18 assume 0 == ~n; 9541#L19 call #t~ret0 := ackermann(~m - 1, 1);< 9543#ackermannENTRY ~m := #in~m;~n := #in~n; 9540#L15 assume !(0 == ~m); 9542#L18 assume !(0 == ~n); 9534#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 9538#ackermannENTRY ~m := #in~m;~n := #in~n; 9536#L15 assume !(0 == ~m); 9533#L18 assume 0 == ~n; 9535#L19 call #t~ret0 := ackermann(~m - 1, 1);< 9515#ackermannENTRY ~m := #in~m;~n := #in~n; 9616#L15 assume !(0 == ~m); 9603#L18 assume !(0 == ~n); 9590#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 9591#ackermannENTRY ~m := #in~m;~n := #in~n; 9614#L15 assume !(0 == ~m); 9611#L18 assume 0 == ~n; 9600#L19 call #t~ret0 := ackermann(~m - 1, 1);< 9602#ackermannENTRY ~m := #in~m;~n := #in~n; 9606#L15 assume 0 == ~m;#res := 1 + ~n; 9604#ackermannFINAL assume true; 9599#ackermannEXIT >#42#return; 9598#L19-1 #res := #t~ret0;havoc #t~ret0; 9597#ackermannFINAL assume true; 9589#ackermannEXIT >#44#return; 9586#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 9587#ackermannENTRY ~m := #in~m;~n := #in~n; 9596#L15 assume 0 == ~m;#res := 1 + ~n; 9594#ackermannFINAL assume true; 9585#ackermannEXIT >#46#return; 9580#L21-2 #res := #t~ret2;havoc #t~ret1;havoc #t~ret2; 9576#ackermannFINAL assume true; 9571#ackermannEXIT >#42#return; 9569#L19-1 #res := #t~ret0;havoc #t~ret0; 9626#ackermannFINAL assume true; 9627#ackermannEXIT >#44#return; 9555#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 9557#ackermannENTRY ~m := #in~m;~n := #in~n; 9554#L15 assume !(0 == ~m); 9556#L18 assume !(0 == ~n); 9750#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 9492#ackermannENTRY ~m := #in~m;~n := #in~n; 9772#L15 assume !(0 == ~m); 9769#L18 assume !(0 == ~n); 9767#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 9768#ackermannENTRY ~m := #in~m;~n := #in~n; 9789#L15 assume !(0 == ~m); 9788#L18 assume !(0 == ~n); 9505#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 9624#ackermannENTRY ~m := #in~m;~n := #in~n; 9623#L15 assume !(0 == ~m); 9622#L18 assume 0 == ~n; 9564#L19 call #t~ret0 := ackermann(~m - 1, 1);< 9574#ackermannENTRY ~m := #in~m;~n := #in~n; 9736#L15 assume 0 == ~m;#res := 1 + ~n; 9613#ackermannFINAL assume true; 9563#ackermannEXIT >#42#return; 9567#L19-1 #res := #t~ret0;havoc #t~ret0; 9786#ackermannFINAL assume true; 9784#ackermannEXIT >#44#return; 9776#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 9782#ackermannENTRY ~m := #in~m;~n := #in~n; 9785#L15 assume 0 == ~m;#res := 1 + ~n; 9783#ackermannFINAL assume true; 9774#ackermannEXIT >#46#return; 9773#L21-2 #res := #t~ret2;havoc #t~ret1;havoc #t~ret2; 9771#ackermannFINAL assume true; 9766#ackermannEXIT >#44#return; 9758#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 9764#ackermannENTRY ~m := #in~m;~n := #in~n; 9770#L15 assume 0 == ~m;#res := 1 + ~n; 9765#ackermannFINAL assume true; 9757#ackermannEXIT >#46#return; 9755#L21-2 #res := #t~ret2;havoc #t~ret1;havoc #t~ret2; 9754#ackermannFINAL assume true; 9749#ackermannEXIT >#44#return; 9745#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 9747#ackermannENTRY ~m := #in~m;~n := #in~n; 9752#L15 assume 0 == ~m;#res := 1 + ~n; 9748#ackermannFINAL assume true; 9744#ackermannEXIT >#46#return; 9675#L21-2 #res := #t~ret2;havoc #t~ret1;havoc #t~ret2; 9628#ackermannFINAL assume true; 9629#ackermannEXIT >#46#return; 9581#L21-2 #res := #t~ret2;havoc #t~ret1;havoc #t~ret2; 9577#ackermannFINAL assume true; 9572#ackermannEXIT >#42#return; 9573#L19-1 #res := #t~ret0;havoc #t~ret0; 9655#ackermannFINAL assume true; 9654#ackermannEXIT >#44#return; 9646#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 9650#ackermannENTRY ~m := #in~m;~n := #in~n; 9649#L15 assume !(0 == ~m); 9648#L18 assume !(0 == ~n); 9642#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 9645#ackermannENTRY ~m := #in~m;~n := #in~n; 9644#L15 assume !(0 == ~m); 9643#L18 assume !(0 == ~n); 9638#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 9641#ackermannENTRY ~m := #in~m;~n := #in~n; 9640#L15 assume !(0 == ~m); 9639#L18 assume !(0 == ~n); 9595#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 9636#ackermannENTRY ~m := #in~m;~n := #in~n; 9637#L15 assume !(0 == ~m); 9621#L18 assume !(0 == ~n); 9559#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 9592#ackermannENTRY ~m := #in~m;~n := #in~n; 9584#L15 assume !(0 == ~m); 9579#L18 assume 0 == ~n; 9522#L19 call #t~ret0 := ackermann(~m - 1, 1);< 9575#ackermannENTRY ~m := #in~m;~n := #in~n; 9793#L15 assume !(0 == ~m); 9521#L18 assume !(0 == ~n); 9523#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 9738#ackermannENTRY ~m := #in~m;~n := #in~n; 9815#L15 assume !(0 == ~m); 9561#L18 assume 0 == ~n; 9562#L19 call #t~ret0 := ackermann(~m - 1, 1);< 9511#ackermannENTRY [2019-01-01 23:54:03,224 INFO L796 eck$LassoCheckResult]: Loop: 9511#ackermannENTRY ~m := #in~m;~n := #in~n; 9612#L15 assume !(0 == ~m); 9610#L18 assume !(0 == ~n); 9510#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 9588#ackermannENTRY ~m := #in~m;~n := #in~n; 9582#L15 assume !(0 == ~m); 9578#L18 assume 0 == ~n; 9509#L19 call #t~ret0 := ackermann(~m - 1, 1);< 9511#ackermannENTRY [2019-01-01 23:54:03,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:03,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1393549654, now seen corresponding path program 8 times [2019-01-01 23:54:03,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:03,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:03,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:03,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:54:03,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:03,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:03,901 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 546 proven. 104 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2019-01-01 23:54:03,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:54:03,902 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:54:03,914 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 23:54:03,967 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 23:54:03,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 23:54:03,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:04,000 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 546 proven. 104 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2019-01-01 23:54:04,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:54:04,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2019-01-01 23:54:04,030 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:54:04,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:04,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1459432636, now seen corresponding path program 6 times [2019-01-01 23:54:04,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:04,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:04,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:04,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:54:04,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:04,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:04,178 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:54:04,178 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:54:04,178 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:54:04,178 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:54:04,178 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:54:04,179 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:04,179 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:54:04,179 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:54:04,179 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ackermann02_false-unreach-call_true-no-overflow_true-termination.c_Iteration13_Loop [2019-01-01 23:54:04,179 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:54:04,179 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:54:04,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:04,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:04,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:04,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:04,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:04,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:04,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:04,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:04,256 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:54:04,256 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 153 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 153 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:04,262 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:04,262 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:04,264 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:04,265 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret2=0} Honda state: {ackermann_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 154 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 154 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:04,285 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:04,285 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:04,288 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:04,288 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 155 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 155 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:04,307 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:04,308 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:04,311 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:04,311 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret1=0} Honda state: {ackermann_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 156 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 156 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:04,331 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:04,331 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:04,334 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:04,334 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret0=0} Honda state: {ackermann_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 157 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 157 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:04,354 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:04,354 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:04,357 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:04,357 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=0} Honda state: {ackermann_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 158 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 158 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:04,376 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:04,376 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:04,379 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:04,379 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~n=1} Honda state: {ackermann_#in~n=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 159 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 159 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:04,399 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:04,400 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 160 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 160 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:04,423 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:54:04,423 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:04,476 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:04,476 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~m=-8} Honda state: {ackermann_#in~m=-8} Generalized eigenvectors: [{ackermann_#in~m=-1}, {ackermann_#in~m=0}, {ackermann_#in~m=0}] Lambdas: [1, 0, 15] Nus: [0, 0] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 161 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 161 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:04,496 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:04,496 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:04,500 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:04,500 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~m=0} Honda state: {ackermann_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2019-01-01 23:54:04,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-01 23:54:04,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=615, Unknown=0, NotChecked=0, Total=702 [2019-01-01 23:54:04,518 INFO L87 Difference]: Start difference. First operand 347 states and 420 transitions. cyclomatic complexity: 80 Second operand 27 states. [2019-01-01 23:54:06,208 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2019-01-01 23:54:07,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:54:07,037 INFO L93 Difference]: Finished difference Result 413 states and 501 transitions. [2019-01-01 23:54:07,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-01 23:54:07,041 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 413 states and 501 transitions. [2019-01-01 23:54:07,045 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-01 23:54:07,049 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 413 states to 409 states and 497 transitions. [2019-01-01 23:54:07,050 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 316 [2019-01-01 23:54:07,050 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 316 [2019-01-01 23:54:07,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 409 states and 497 transitions. [2019-01-01 23:54:07,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:54:07,051 INFO L705 BuchiCegarLoop]: Abstraction has 409 states and 497 transitions. [2019-01-01 23:54:07,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states and 497 transitions. [2019-01-01 23:54:07,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 386. [2019-01-01 23:54:07,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2019-01-01 23:54:07,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 473 transitions. [2019-01-01 23:54:07,062 INFO L728 BuchiCegarLoop]: Abstraction has 386 states and 473 transitions. [2019-01-01 23:54:07,063 INFO L608 BuchiCegarLoop]: Abstraction has 386 states and 473 transitions. [2019-01-01 23:54:07,063 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2019-01-01 23:54:07,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 386 states and 473 transitions. [2019-01-01 23:54:07,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-01 23:54:07,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:54:07,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:54:07,067 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [24, 18, 15, 12, 12, 6, 6, 6, 6, 6, 5, 5, 4, 4, 1, 1, 1, 1] [2019-01-01 23:54:07,067 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2019-01-01 23:54:07,068 INFO L794 eck$LassoCheckResult]: Stem: 10811#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; 10772#L27 assume !(main_~m~0 < 0 || main_~m~0 > 3);main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; 10773#L33 assume !(main_~n~0 < 0 || main_~n~0 > 23); 10783#L39 call main_#t~ret5 := ackermann(main_~m~0, main_~n~0);< 10784#ackermannENTRY ~m := #in~m;~n := #in~n; 10841#L15 assume !(0 == ~m); 10842#L18 assume !(0 == ~n); 10835#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 10838#ackermannENTRY ~m := #in~m;~n := #in~n; 10837#L15 assume !(0 == ~m); 10836#L18 assume 0 == ~n; 10831#L19 call #t~ret0 := ackermann(~m - 1, 1);< 10833#ackermannENTRY ~m := #in~m;~n := #in~n; 10830#L15 assume !(0 == ~m); 10832#L18 assume !(0 == ~n); 10823#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 10827#ackermannENTRY ~m := #in~m;~n := #in~n; 10828#L15 assume !(0 == ~m); 10822#L18 assume 0 == ~n; 10786#L19 call #t~ret0 := ackermann(~m - 1, 1);< 10796#ackermannENTRY ~m := #in~m;~n := #in~n; 10873#L15 assume !(0 == ~m); 10869#L18 assume !(0 == ~n); 10799#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 11114#ackermannENTRY ~m := #in~m;~n := #in~n; 11124#L15 assume !(0 == ~m); 11123#L18 assume 0 == ~n; 11122#L19 call #t~ret0 := ackermann(~m - 1, 1);< 10793#ackermannENTRY ~m := #in~m;~n := #in~n; 11127#L15 assume 0 == ~m;#res := 1 + ~n; 11126#ackermannFINAL assume true; 11121#ackermannEXIT >#42#return; 11120#L19-1 #res := #t~ret0;havoc #t~ret0; 11119#ackermannFINAL assume true; 11118#ackermannEXIT >#44#return; 11106#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 11107#ackermannENTRY ~m := #in~m;~n := #in~n; 11116#L15 assume 0 == ~m;#res := 1 + ~n; 11115#ackermannFINAL assume true; 11105#ackermannEXIT >#46#return; 11102#L21-2 #res := #t~ret2;havoc #t~ret1;havoc #t~ret2; 11099#ackermannFINAL assume true; 11074#ackermannEXIT >#42#return; 11073#L19-1 #res := #t~ret0;havoc #t~ret0; 11072#ackermannFINAL assume true; 11071#ackermannEXIT >#44#return; 10894#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 11067#ackermannENTRY ~m := #in~m;~n := #in~n; 11086#L15 assume !(0 == ~m); 10893#L18 assume !(0 == ~n); 10875#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 10883#ackermannENTRY ~m := #in~m;~n := #in~n; 10879#L15 assume !(0 == ~m); 10880#L18 assume !(0 == ~n); 10871#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 10874#ackermannENTRY ~m := #in~m;~n := #in~n; 10870#L15 assume !(0 == ~m); 10872#L18 assume !(0 == ~n); 10862#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 10865#ackermannENTRY ~m := #in~m;~n := #in~n; 10860#L15 assume !(0 == ~m); 10864#L18 assume 0 == ~n; 11050#L19 call #t~ret0 := ackermann(~m - 1, 1);< 11052#ackermannENTRY ~m := #in~m;~n := #in~n; 11056#L15 assume 0 == ~m;#res := 1 + ~n; 11053#ackermannFINAL assume true; 11049#ackermannEXIT >#42#return; 11047#L19-1 #res := #t~ret0;havoc #t~ret0; 11044#ackermannFINAL assume true; 11042#ackermannEXIT >#44#return; 11034#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 11038#ackermannENTRY ~m := #in~m;~n := #in~n; 11043#L15 assume 0 == ~m;#res := 1 + ~n; 11039#ackermannFINAL assume true; 11030#ackermannEXIT >#46#return; 11037#L21-2 #res := #t~ret2;havoc #t~ret1;havoc #t~ret2; 11088#ackermannFINAL assume true; 11087#ackermannEXIT >#44#return; 11016#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 11025#ackermannENTRY ~m := #in~m;~n := #in~n; 11064#L15 assume 0 == ~m;#res := 1 + ~n; 11063#ackermannFINAL assume true; 11014#ackermannEXIT >#46#return; 11021#L21-2 #res := #t~ret2;havoc #t~ret1;havoc #t~ret2; 11084#ackermannFINAL assume true; 11081#ackermannEXIT >#44#return; 11077#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 11079#ackermannENTRY ~m := #in~m;~n := #in~n; 11083#L15 assume 0 == ~m;#res := 1 + ~n; 11080#ackermannFINAL assume true; 11076#ackermannEXIT >#46#return; 10921#L21-2 #res := #t~ret2;havoc #t~ret1;havoc #t~ret2; 11069#ackermannFINAL assume true; 11065#ackermannEXIT >#46#return; 10912#L21-2 #res := #t~ret2;havoc #t~ret1;havoc #t~ret2; 10905#ackermannFINAL assume true; 10903#ackermannEXIT >#42#return; 10901#L19-1 #res := #t~ret0;havoc #t~ret0; 10900#ackermannFINAL assume true; 10899#ackermannEXIT >#44#return; 10775#L21-1 call #t~ret2 := ackermann(~m - 1, #t~ret1);< 10897#ackermannENTRY ~m := #in~m;~n := #in~n; 10896#L15 assume !(0 == ~m); 10895#L18 assume !(0 == ~n); 10774#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 10777#ackermannENTRY ~m := #in~m;~n := #in~n; 10973#L15 assume !(0 == ~m); 10972#L18 assume !(0 == ~n); 10969#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 10970#ackermannENTRY ~m := #in~m;~n := #in~n; 10982#L15 assume !(0 == ~m); 10981#L18 assume !(0 == ~n); 10978#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 10979#ackermannENTRY ~m := #in~m;~n := #in~n; 10986#L15 assume !(0 == ~m); 10985#L18 assume !(0 == ~n); 10805#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 10804#ackermannENTRY ~m := #in~m;~n := #in~n; 10806#L15 assume !(0 == ~m); 11094#L18 assume !(0 == ~n); 10816#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 10998#ackermannENTRY ~m := #in~m;~n := #in~n; 10997#L15 assume !(0 == ~m); 10995#L18 assume 0 == ~n; 10787#L19 call #t~ret0 := ackermann(~m - 1, 1);< 10855#ackermannENTRY ~m := #in~m;~n := #in~n; 10853#L15 assume !(0 == ~m); 10854#L18 assume !(0 == ~n); 10798#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 11062#ackermannENTRY ~m := #in~m;~n := #in~n; 11057#L15 assume !(0 == ~m); 11054#L18 assume 0 == ~n; 10780#L19 call #t~ret0 := ackermann(~m - 1, 1);< 10856#ackermannENTRY [2019-01-01 23:54:07,068 INFO L796 eck$LassoCheckResult]: Loop: 10856#ackermannENTRY ~m := #in~m;~n := #in~n; 11055#L15 assume !(0 == ~m); 10807#L18 assume !(0 == ~n); 10778#L21 call #t~ret1 := ackermann(~m, ~n - 1);< 10779#ackermannENTRY ~m := #in~m;~n := #in~n; 11068#L15 assume !(0 == ~m); 10852#L18 assume 0 == ~n; 10782#L19 call #t~ret0 := ackermann(~m - 1, 1);< 10856#ackermannENTRY [2019-01-01 23:54:07,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:07,068 INFO L82 PathProgramCache]: Analyzing trace with hash -410189577, now seen corresponding path program 9 times [2019-01-01 23:54:07,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:07,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:07,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:07,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:54:07,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:07,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:07,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:07,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:07,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1459432636, now seen corresponding path program 7 times [2019-01-01 23:54:07,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:07,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:07,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:07,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:54:07,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:07,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:07,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:54:07,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:54:07,114 INFO L82 PathProgramCache]: Analyzing trace with hash -615721038, now seen corresponding path program 10 times [2019-01-01 23:54:07,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:54:07,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:54:07,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:07,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:54:07,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:54:07,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:54:07,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1180 backedges. 527 proven. 279 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2019-01-01 23:54:07,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:54:07,742 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 23:54:07,752 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 23:54:07,802 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 23:54:07,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 23:54:07,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:54:07,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1180 backedges. 464 proven. 365 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-01-01 23:54:07,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:54:07,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-01-01 23:54:07,998 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:54:07,998 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:54:07,999 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:54:07,999 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:54:07,999 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:54:07,999 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:07,999 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:54:07,999 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:54:08,000 INFO L131 ssoRankerPreferences]: Filename of dumped script: Ackermann02_false-unreach-call_true-no-overflow_true-termination.c_Iteration14_Loop [2019-01-01 23:54:08,000 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:54:08,000 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:54:08,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:08,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:08,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:08,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:08,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:08,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:08,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:08,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:54:08,084 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:54:08,084 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 163 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 163 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:08,091 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:08,091 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:08,094 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:08,094 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret0=0} Honda state: {ackermann_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 164 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 164 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:08,115 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:08,115 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:08,118 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:08,118 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret2=0} Honda state: {ackermann_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 165 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 165 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:08,140 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:08,141 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:08,145 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:08,145 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~m=0} Honda state: {ackermann_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 166 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 166 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:08,169 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:08,169 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:08,172 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:08,172 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~n=1} Honda state: {ackermann_#in~n=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 167 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 167 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:08,194 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:08,194 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:08,202 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:08,202 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#t~ret1=0} Honda state: {ackermann_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 168 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:54:08,222 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:08,223 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 168 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:08,226 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:08,227 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_~n=0} Honda state: {ackermann_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 169 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 169 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:08,247 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:08,247 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:08,250 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:08,250 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#res=0} Honda state: {ackermann_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 170 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 170 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:08,270 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:54:08,270 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 171 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 171 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:54:08,294 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:54:08,294 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:54:08,340 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:54:08,340 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ackermann_#in~m=-5} Honda state: {ackermann_#in~m=-5} Generalized eigenvectors: [{ackermann_#in~m=0}, {ackermann_#in~m=0}, {ackermann_#in~m=-1}] Lambdas: [9, 0, 1] Nus: [0, 0] [2019-01-01 23:54:08,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 23:54:08,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-01-01 23:54:08,358 INFO L87 Difference]: Start difference. First operand 386 states and 473 transitions. cyclomatic complexity: 94 Second operand 11 states. [2019-01-01 23:54:08,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:54:08,687 INFO L93 Difference]: Finished difference Result 379 states and 464 transitions. [2019-01-01 23:54:08,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 23:54:08,690 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 379 states and 464 transitions. [2019-01-01 23:54:08,694 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:54:08,695 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 379 states to 0 states and 0 transitions. [2019-01-01 23:54:08,695 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:54:08,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:54:08,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:54:08,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:54:08,695 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:54:08,695 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:54:08,695 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:54:08,695 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2019-01-01 23:54:08,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 23:54:08,696 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:54:08,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 23:54:08,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:54:08 BoogieIcfgContainer [2019-01-01 23:54:08,703 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:54:08,704 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:54:08,704 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:54:08,704 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:54:08,705 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:53:30" (3/4) ... [2019-01-01 23:54:08,708 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 23:54:08,708 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:54:08,709 INFO L168 Benchmark]: Toolchain (without parser) took 39189.95 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 485.5 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -113.2 MB). Peak memory consumption was 372.3 MB. Max. memory is 11.5 GB. [2019-01-01 23:54:08,710 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:54:08,710 INFO L168 Benchmark]: CACSL2BoogieTranslator took 274.88 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:54:08,710 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.93 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:54:08,718 INFO L168 Benchmark]: Boogie Preprocessor took 21.60 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:54:08,718 INFO L168 Benchmark]: RCFGBuilder took 481.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -175.5 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-01-01 23:54:08,719 INFO L168 Benchmark]: BuchiAutomizer took 38361.06 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 343.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.5 MB). Peak memory consumption was 395.5 MB. Max. memory is 11.5 GB. [2019-01-01 23:54:08,719 INFO L168 Benchmark]: Witness Printer took 4.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:54:08,721 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 274.88 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.93 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.60 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 481.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -175.5 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 38361.06 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 343.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.5 MB). Peak memory consumption was 395.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 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 \old(n) and consists of 5 locations. One deterministic module has affine ranking function -2 * \old(n) + 1 and consists of 4 locations. One deterministic module has affine ranking function \old(m) and consists of 11 locations. One deterministic module has affine ranking function m and consists of 12 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 25 locations. 10 modules have a trivial ranking function, the largest among these consists of 27 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 38.3s and 15 iterations. TraceHistogramMax:24. Analysis of lassos took 20.4s. Construction of modules took 4.9s. Büchi inclusion checks took 12.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 15. Automata minimization 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 278 StatesRemovedByMinimization, 14 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 386 states and ocurred in iteration 13. Nontrivial modules had stage [3, 1, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 10/21 HoareTripleCheckerStatistics: 413 SDtfs, 734 SDslu, 1218 SDs, 0 SdLazy, 4001 SolverSat, 1128 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT2 SILN6 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital24 mio100 ax100 hnf100 lsp62 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq188 hnf94 smp95 dnf149 smp100 tf104 neg94 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 221ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 126 LassoNonterminationAnalysisSatUnbounded: 12 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 3.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...