./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/recursive-simple/fibo_5_true-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e 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-simple/fibo_5_true-unreach-call_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 c7b71b458b3f08f188a62c7539b715f43fd7f97d .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-29 00:03:08,581 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-29 00:03:08,583 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-29 00:03:08,600 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-29 00:03:08,600 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-29 00:03:08,601 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-29 00:03:08,602 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-29 00:03:08,604 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-29 00:03:08,606 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-29 00:03:08,607 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-29 00:03:08,608 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-29 00:03:08,609 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-29 00:03:08,609 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-29 00:03:08,610 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-29 00:03:08,612 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-29 00:03:08,613 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-29 00:03:08,614 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-29 00:03:08,615 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-29 00:03:08,618 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-29 00:03:08,619 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-29 00:03:08,621 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-29 00:03:08,622 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-29 00:03:08,624 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-29 00:03:08,625 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-29 00:03:08,625 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-29 00:03:08,626 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-29 00:03:08,627 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-29 00:03:08,627 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-29 00:03:08,628 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-29 00:03:08,630 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-29 00:03:08,630 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-29 00:03:08,631 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-29 00:03:08,631 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-29 00:03:08,631 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-29 00:03:08,632 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-29 00:03:08,633 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-29 00:03:08,633 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-29 00:03:08,665 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-29 00:03:08,665 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-29 00:03:08,668 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-29 00:03:08,669 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-29 00:03:08,669 INFO L133 SettingsManager]: * Use SBE=true [2018-11-29 00:03:08,669 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-29 00:03:08,669 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-29 00:03:08,670 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-29 00:03:08,671 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-29 00:03:08,671 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-29 00:03:08,671 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-29 00:03:08,672 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-29 00:03:08,672 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-29 00:03:08,672 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-29 00:03:08,672 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-29 00:03:08,672 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-29 00:03:08,672 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-29 00:03:08,673 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-29 00:03:08,673 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-29 00:03:08,673 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-29 00:03:08,673 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-29 00:03:08,673 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-29 00:03:08,674 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-29 00:03:08,674 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-29 00:03:08,674 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-29 00:03:08,674 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-29 00:03:08,674 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-29 00:03:08,676 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-29 00:03:08,676 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-29 00:03:08,677 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-29 00:03:08,677 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-29 00:03:08,678 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-29 00:03:08,679 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 -> c7b71b458b3f08f188a62c7539b715f43fd7f97d [2018-11-29 00:03:08,747 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-29 00:03:08,766 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-29 00:03:08,769 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-29 00:03:08,770 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-29 00:03:08,771 INFO L276 PluginConnector]: CDTParser initialized [2018-11-29 00:03:08,771 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/fibo_5_true-unreach-call_true-termination.c [2018-11-29 00:03:08,838 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65788f771/b4074faf2f8b4ad7a01f0044091ab736/FLAGc3b5f39e5 [2018-11-29 00:03:09,352 INFO L307 CDTParser]: Found 1 translation units. [2018-11-29 00:03:09,353 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/fibo_5_true-unreach-call_true-termination.c [2018-11-29 00:03:09,363 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65788f771/b4074faf2f8b4ad7a01f0044091ab736/FLAGc3b5f39e5 [2018-11-29 00:03:09,737 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65788f771/b4074faf2f8b4ad7a01f0044091ab736 [2018-11-29 00:03:09,741 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-29 00:03:09,743 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-29 00:03:09,744 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-29 00:03:09,744 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-29 00:03:09,749 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-29 00:03:09,750 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:03:09" (1/1) ... [2018-11-29 00:03:09,756 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@698040b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:09, skipping insertion in model container [2018-11-29 00:03:09,756 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:03:09" (1/1) ... [2018-11-29 00:03:09,764 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-29 00:03:09,784 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-29 00:03:09,992 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:03:10,000 INFO L191 MainTranslator]: Completed pre-run [2018-11-29 00:03:10,019 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:03:10,034 INFO L195 MainTranslator]: Completed translation [2018-11-29 00:03:10,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:10 WrapperNode [2018-11-29 00:03:10,035 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-29 00:03:10,036 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-29 00:03:10,036 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-29 00:03:10,036 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-29 00:03:10,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:10" (1/1) ... [2018-11-29 00:03:10,048 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:10" (1/1) ... [2018-11-29 00:03:10,075 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-29 00:03:10,075 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-29 00:03:10,075 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-29 00:03:10,076 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-29 00:03:10,086 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:10" (1/1) ... [2018-11-29 00:03:10,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:10" (1/1) ... [2018-11-29 00:03:10,088 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:10" (1/1) ... [2018-11-29 00:03:10,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:10" (1/1) ... [2018-11-29 00:03:10,090 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:10" (1/1) ... [2018-11-29 00:03:10,093 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:10" (1/1) ... [2018-11-29 00:03:10,094 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:10" (1/1) ... [2018-11-29 00:03:10,096 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-29 00:03:10,096 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-29 00:03:10,096 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-29 00:03:10,096 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-29 00:03:10,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:10" (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 [2018-11-29 00:03:10,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-29 00:03:10,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-29 00:03:10,238 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2018-11-29 00:03:10,238 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2018-11-29 00:03:10,433 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-29 00:03:10,433 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-29 00:03:10,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:03:10 BoogieIcfgContainer [2018-11-29 00:03:10,434 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-29 00:03:10,435 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-29 00:03:10,435 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-29 00:03:10,440 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-29 00:03:10,441 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:03:10,441 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:03:09" (1/3) ... [2018-11-29 00:03:10,443 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5b7e6252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:03:10, skipping insertion in model container [2018-11-29 00:03:10,443 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:03:10,443 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:03:10" (2/3) ... [2018-11-29 00:03:10,444 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5b7e6252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:03:10, skipping insertion in model container [2018-11-29 00:03:10,444 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:03:10,444 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:03:10" (3/3) ... [2018-11-29 00:03:10,447 INFO L375 chiAutomizerObserver]: Analyzing ICFG fibo_5_true-unreach-call_true-termination.c [2018-11-29 00:03:10,572 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-29 00:03:10,573 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-29 00:03:10,574 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-29 00:03:10,574 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-29 00:03:10,574 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-29 00:03:10,574 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-29 00:03:10,574 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-29 00:03:10,575 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-29 00:03:10,575 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-29 00:03:10,601 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-29 00:03:10,639 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:03:10,640 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:10,640 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:10,650 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-29 00:03:10,651 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:03:10,651 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-29 00:03:10,651 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-11-29 00:03:10,654 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:03:10,654 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:10,654 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:10,655 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-29 00:03:10,656 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:03:10,663 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 5; 19#L25true call main_#t~ret2 := fibo(main_~x~0);< 11#fiboENTRYtrue [2018-11-29 00:03:10,664 INFO L796 eck$LassoCheckResult]: Loop: 11#fiboENTRYtrue ~n := #in~n; 7#L6true assume !(~n < 1); 10#L8true assume !(1 == ~n); 18#L11true call #t~ret0 := fibo(~n - 1);< 11#fiboENTRYtrue [2018-11-29 00:03:10,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:10,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1021, now seen corresponding path program 1 times [2018-11-29 00:03:10,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:10,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:10,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:10,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:10,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:10,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:10,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:10,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:10,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1420172, now seen corresponding path program 1 times [2018-11-29 00:03:10,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:10,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:10,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:10,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:10,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:10,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:10,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:10,800 INFO L82 PathProgramCache]: Analyzing trace with hash 943411592, now seen corresponding path program 1 times [2018-11-29 00:03:10,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:10,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:10,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:10,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:10,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:10,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:11,002 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:11,003 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:11,003 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:11,004 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:11,004 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:03:11,004 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:11,004 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:11,004 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:11,004 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5_true-unreach-call_true-termination.c_Iteration1_Loop [2018-11-29 00:03:11,005 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:11,005 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:11,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:11,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:11,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:11,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:11,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:11,210 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-11-29 00:03:11,295 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:11,296 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) [2018-11-29 00:03:11,311 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:11,312 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:11,330 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:11,330 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_~n=0} Honda state: {fibo_~n=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) [2018-11-29 00:03:11,369 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:11,370 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:11,383 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:11,383 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#res=0} Honda state: {fibo_#res=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 [2018-11-29 00:03:11,424 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:11,424 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:11,428 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:11,428 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret0=0} Honda state: {fibo_#t~ret0=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 [2018-11-29 00:03:11,450 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:11,450 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:11,455 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:11,455 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret1=0} Honda state: {fibo_#t~ret1=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 [2018-11-29 00:03:11,479 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:11,479 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 [2018-11-29 00:03:11,510 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:03:11,511 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:11,547 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:03:11,549 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:11,550 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:11,550 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:11,550 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:11,550 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:03:11,550 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:11,550 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:11,550 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:11,551 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5_true-unreach-call_true-termination.c_Iteration1_Loop [2018-11-29 00:03:11,551 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:11,551 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:11,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:11,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:11,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:11,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:11,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:11,767 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:11,773 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:03:11,775 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 [2018-11-29 00:03:11,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:11,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:11,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:11,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:11,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:11,781 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:11,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:11,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:11,786 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 [2018-11-29 00:03:11,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:11,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:11,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:11,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:11,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:11,788 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:11,789 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:11,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:11,791 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 [2018-11-29 00:03:11,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:11,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:11,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:11,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:11,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:11,794 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:11,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:11,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:11,797 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 [2018-11-29 00:03:11,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:11,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:11,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:11,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:11,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:11,799 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:11,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:11,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:11,807 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 [2018-11-29 00:03:11,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:11,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:11,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:11,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:11,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:11,811 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:11,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:11,824 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:03:11,830 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:03:11,830 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:03:11,833 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:03:11,833 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:03:11,834 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:03:11,834 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2018-11-29 00:03:11,836 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:03:12,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:12,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:12,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:12,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:12,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:12,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:03:12,588 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 [2018-11-29 00:03:12,589 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 4 states. [2018-11-29 00:03:13,008 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 4 states. Result 47 states and 59 transitions. Complement of second has 12 states. [2018-11-29 00:03:13,009 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 [2018-11-29 00:03:13,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-29 00:03:13,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-11-29 00:03:13,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-29 00:03:13,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:13,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-29 00:03:13,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:13,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2018-11-29 00:03:13,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:13,019 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 59 transitions. [2018-11-29 00:03:13,025 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:03:13,034 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 24 states and 33 transitions. [2018-11-29 00:03:13,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-29 00:03:13,036 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-29 00:03:13,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 33 transitions. [2018-11-29 00:03:13,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:13,040 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-29 00:03:13,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 33 transitions. [2018-11-29 00:03:13,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2018-11-29 00:03:13,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-29 00:03:13,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-11-29 00:03:13,081 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-11-29 00:03:13,081 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-11-29 00:03:13,081 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-29 00:03:13,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2018-11-29 00:03:13,083 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:03:13,083 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:13,083 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:13,084 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:13,085 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:13,085 INFO L794 eck$LassoCheckResult]: Stem: 120#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 5; 121#L25 call main_#t~ret2 := fibo(main_~x~0);< 125#fiboENTRY ~n := #in~n; 126#L6 assume !(~n < 1); 124#L8 assume !(1 == ~n); 118#L11 call #t~ret0 := fibo(~n - 1);< 127#fiboENTRY ~n := #in~n; 128#L6 assume ~n < 1;#res := 0; 123#fiboFINAL assume true; 117#fiboEXIT >#32#return; 119#L11-1 [2018-11-29 00:03:13,085 INFO L796 eck$LassoCheckResult]: Loop: 119#L11-1 call #t~ret1 := fibo(~n - 2);< 132#fiboENTRY ~n := #in~n; 135#L6 assume !(~n < 1); 134#L8 assume !(1 == ~n); 130#L11 call #t~ret0 := fibo(~n - 1);< 132#fiboENTRY ~n := #in~n; 135#L6 assume ~n < 1;#res := 0; 131#fiboFINAL assume true; 133#fiboEXIT >#32#return; 119#L11-1 [2018-11-29 00:03:13,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:13,086 INFO L82 PathProgramCache]: Analyzing trace with hash 531553871, now seen corresponding path program 1 times [2018-11-29 00:03:13,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:13,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:13,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:13,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:13,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:13,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:13,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-29 00:03:13,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:03:13,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:03:13,308 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:03:13,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:13,308 INFO L82 PathProgramCache]: Analyzing trace with hash -606345326, now seen corresponding path program 1 times [2018-11-29 00:03:13,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:13,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:13,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:13,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:13,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:13,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:13,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-29 00:03:13,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:03:13,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:03:13,780 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:03:13,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-29 00:03:13,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-29 00:03:13,785 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-11-29 00:03:13,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:13,985 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2018-11-29 00:03:13,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-29 00:03:13,988 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. [2018-11-29 00:03:13,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:03:13,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 29 transitions. [2018-11-29 00:03:13,992 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-29 00:03:13,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-29 00:03:13,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2018-11-29 00:03:13,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:13,994 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-11-29 00:03:13,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2018-11-29 00:03:13,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-29 00:03:13,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-29 00:03:13,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2018-11-29 00:03:13,999 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-11-29 00:03:13,999 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-11-29 00:03:13,999 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-29 00:03:13,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2018-11-29 00:03:14,000 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-29 00:03:14,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:14,001 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:14,002 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:14,002 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:14,002 INFO L794 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 5; 184#L25 call main_#t~ret2 := fibo(main_~x~0);< 188#fiboENTRY ~n := #in~n; 189#L6 assume !(~n < 1); 187#L8 assume !(1 == ~n); 181#L11 call #t~ret0 := fibo(~n - 1);< 190#fiboENTRY ~n := #in~n; 191#L6 assume !(~n < 1); 185#L8 assume 1 == ~n;#res := 1; 186#fiboFINAL assume true; 180#fiboEXIT >#32#return; 182#L11-1 [2018-11-29 00:03:14,002 INFO L796 eck$LassoCheckResult]: Loop: 182#L11-1 call #t~ret1 := fibo(~n - 2);< 195#fiboENTRY ~n := #in~n; 202#L6 assume !(~n < 1); 201#L8 assume !(1 == ~n); 193#L11 call #t~ret0 := fibo(~n - 1);< 195#fiboENTRY ~n := #in~n; 202#L6 assume !(~n < 1); 201#L8 assume 1 == ~n;#res := 1; 199#fiboFINAL assume true; 197#fiboEXIT >#32#return; 182#L11-1 [2018-11-29 00:03:14,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:14,003 INFO L82 PathProgramCache]: Analyzing trace with hash -701674289, now seen corresponding path program 1 times [2018-11-29 00:03:14,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:14,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:14,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:14,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:14,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:14,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:14,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:03:14,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:14,071 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:03:14,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:14,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:14,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:03:14,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:03:14,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-29 00:03:14,124 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:03:14,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:14,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1616811028, now seen corresponding path program 1 times [2018-11-29 00:03:14,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:14,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:14,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:14,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:14,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:14,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:14,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:14,355 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:14,355 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:14,355 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:14,356 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:14,356 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:03:14,356 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:14,356 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:14,357 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:14,357 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5_true-unreach-call_true-termination.c_Iteration3_Loop [2018-11-29 00:03:14,357 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:14,357 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:14,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:14,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:14,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:14,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:14,493 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:14,493 INFO L412 LassoAnalysis]: Checking for nontermination... 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 [2018-11-29 00:03:14,497 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:14,497 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:14,521 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:03:14,522 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:15,222 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:03:15,225 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:15,225 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:15,225 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:15,225 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:15,226 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:03:15,226 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:15,226 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:15,226 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:15,226 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5_true-unreach-call_true-termination.c_Iteration3_Loop [2018-11-29 00:03:15,226 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:15,226 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:15,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:15,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:15,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:15,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:15,382 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:15,382 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:03:15,382 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 [2018-11-29 00:03:15,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:15,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:15,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:15,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:15,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:15,386 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:15,386 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:15,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:15,390 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 [2018-11-29 00:03:15,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:15,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:15,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:15,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:15,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:15,394 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:15,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:15,402 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:03:15,408 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:03:15,408 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:03:15,408 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:03:15,408 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:03:15,409 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:03:15,409 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-29 00:03:15,409 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:03:15,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:15,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:15,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:15,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:15,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:15,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:03:15,659 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-29 00:03:15,660 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-11-29 00:03:15,927 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 134 states and 182 transitions. Complement of second has 28 states. [2018-11-29 00:03:15,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-29 00:03:15,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-29 00:03:15,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2018-11-29 00:03:15,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 10 letters. [2018-11-29 00:03:15,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:15,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 21 letters. Loop has 10 letters. [2018-11-29 00:03:15,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:15,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 20 letters. [2018-11-29 00:03:15,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:15,937 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 182 transitions. [2018-11-29 00:03:15,946 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-29 00:03:15,953 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 107 states and 151 transitions. [2018-11-29 00:03:15,953 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2018-11-29 00:03:15,954 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2018-11-29 00:03:15,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 151 transitions. [2018-11-29 00:03:15,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:15,955 INFO L705 BuchiCegarLoop]: Abstraction has 107 states and 151 transitions. [2018-11-29 00:03:15,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 151 transitions. [2018-11-29 00:03:15,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 93. [2018-11-29 00:03:15,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-29 00:03:15,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 125 transitions. [2018-11-29 00:03:15,975 INFO L728 BuchiCegarLoop]: Abstraction has 93 states and 125 transitions. [2018-11-29 00:03:15,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-29 00:03:15,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-29 00:03:15,976 INFO L87 Difference]: Start difference. First operand 93 states and 125 transitions. Second operand 7 states. [2018-11-29 00:03:16,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:16,096 INFO L93 Difference]: Finished difference Result 108 states and 146 transitions. [2018-11-29 00:03:16,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-29 00:03:16,099 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 146 transitions. [2018-11-29 00:03:16,105 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-29 00:03:16,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 105 states and 143 transitions. [2018-11-29 00:03:16,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2018-11-29 00:03:16,110 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2018-11-29 00:03:16,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 143 transitions. [2018-11-29 00:03:16,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:16,111 INFO L705 BuchiCegarLoop]: Abstraction has 105 states and 143 transitions. [2018-11-29 00:03:16,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 143 transitions. [2018-11-29 00:03:16,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2018-11-29 00:03:16,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-29 00:03:16,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2018-11-29 00:03:16,124 INFO L728 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2018-11-29 00:03:16,124 INFO L608 BuchiCegarLoop]: Abstraction has 93 states and 124 transitions. [2018-11-29 00:03:16,124 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-29 00:03:16,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 124 transitions. [2018-11-29 00:03:16,126 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-29 00:03:16,126 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:16,126 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:16,128 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:16,128 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:16,128 INFO L794 eck$LassoCheckResult]: Stem: 703#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 5; 704#L25 call main_#t~ret2 := fibo(main_~x~0);< 726#fiboENTRY ~n := #in~n; 748#L6 assume !(~n < 1); 707#L8 assume !(1 == ~n); 708#L11 call #t~ret0 := fibo(~n - 1);< 717#fiboENTRY ~n := #in~n; 719#L6 assume !(~n < 1); 728#L8 assume !(1 == ~n); 718#L11 call #t~ret0 := fibo(~n - 1);< 717#fiboENTRY ~n := #in~n; 719#L6 assume !(~n < 1); 728#L8 assume !(1 == ~n); 718#L11 call #t~ret0 := fibo(~n - 1);< 717#fiboENTRY ~n := #in~n; 720#L6 assume !(~n < 1); 752#L8 assume 1 == ~n;#res := 1; 751#fiboFINAL assume true; 750#fiboEXIT >#32#return; 710#L11-1 call #t~ret1 := fibo(~n - 2);< 749#fiboENTRY ~n := #in~n; 777#L6 assume ~n < 1;#res := 0; 774#fiboFINAL assume true; 773#fiboEXIT >#34#return; 772#L11-2 #res := #t~ret0 + #t~ret1;havoc #t~ret1;havoc #t~ret0; 771#fiboFINAL assume true; 759#fiboEXIT >#32#return; 760#L11-1 [2018-11-29 00:03:16,128 INFO L796 eck$LassoCheckResult]: Loop: 760#L11-1 call #t~ret1 := fibo(~n - 2);< 766#fiboENTRY ~n := #in~n; 775#L6 assume !(~n < 1); 768#L8 assume !(1 == ~n); 763#L11 call #t~ret0 := fibo(~n - 1);< 766#fiboENTRY ~n := #in~n; 775#L6 assume !(~n < 1); 768#L8 assume 1 == ~n;#res := 1; 769#fiboFINAL assume true; 770#fiboEXIT >#32#return; 760#L11-1 [2018-11-29 00:03:16,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:16,129 INFO L82 PathProgramCache]: Analyzing trace with hash -240562386, now seen corresponding path program 1 times [2018-11-29 00:03:16,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:16,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:16,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:16,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:16,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:16,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:16,247 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-29 00:03:16,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:16,248 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:03:16,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:16,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:16,286 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-29 00:03:16,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:03:16,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-29 00:03:16,310 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:03:16,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:16,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1616811028, now seen corresponding path program 2 times [2018-11-29 00:03:16,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:16,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:16,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:16,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:16,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:16,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:16,483 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:16,483 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:16,484 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:16,484 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:16,484 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:03:16,484 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:16,484 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:16,484 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:16,484 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5_true-unreach-call_true-termination.c_Iteration4_Loop [2018-11-29 00:03:16,484 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:16,485 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:16,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:16,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:16,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:16,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:16,582 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:16,583 INFO L412 LassoAnalysis]: Checking for nontermination... 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 [2018-11-29 00:03:16,589 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:16,589 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 [2018-11-29 00:03:16,616 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:03:16,616 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:17,264 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:03:17,267 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:17,267 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:17,267 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:17,267 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:17,267 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:03:17,268 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:17,268 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:17,268 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:17,268 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5_true-unreach-call_true-termination.c_Iteration4_Loop [2018-11-29 00:03:17,268 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:17,268 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:17,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:17,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:17,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:17,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:17,385 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:17,385 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:03:17,387 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 [2018-11-29 00:03:17,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:17,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:17,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:17,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:17,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:17,389 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:17,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:17,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:17,391 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 [2018-11-29 00:03:17,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:17,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:17,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:17,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:17,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:17,394 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:17,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:17,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:17,396 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 [2018-11-29 00:03:17,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:17,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:17,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:17,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:17,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:17,400 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:17,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:17,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:03:17,405 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 [2018-11-29 00:03:17,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:17,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:17,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:17,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:17,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:17,409 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:17,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:17,415 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:03:17,419 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:03:17,419 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:03:17,420 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:03:17,420 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:03:17,420 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:03:17,420 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_~n) = 1*fibo_~n Supporting invariants [] [2018-11-29 00:03:17,421 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:03:17,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:17,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:17,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:17,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:17,649 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:03:17,650 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-29 00:03:17,650 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-11-29 00:03:17,852 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 162 states and 216 transitions. Complement of second has 25 states. [2018-11-29 00:03:17,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-29 00:03:17,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-29 00:03:17,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2018-11-29 00:03:17,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 27 letters. Loop has 10 letters. [2018-11-29 00:03:17,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:17,857 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:03:17,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:17,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:17,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:17,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:17,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:18,093 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:03:18,094 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-29 00:03:18,094 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-11-29 00:03:18,285 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 287 states and 386 transitions. Complement of second has 25 states. [2018-11-29 00:03:18,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-29 00:03:18,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-29 00:03:18,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2018-11-29 00:03:18,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 27 letters. Loop has 10 letters. [2018-11-29 00:03:18,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:18,292 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:03:18,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:18,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:18,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:18,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:18,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:18,622 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:03:18,622 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-29 00:03:18,623 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-11-29 00:03:19,109 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 124 transitions. cyclomatic complexity: 36. Second operand 7 states. Result 825 states and 1090 transitions. Complement of second has 112 states. [2018-11-29 00:03:19,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-29 00:03:19,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-29 00:03:19,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2018-11-29 00:03:19,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 27 letters. Loop has 10 letters. [2018-11-29 00:03:19,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:19,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 37 letters. Loop has 10 letters. [2018-11-29 00:03:19,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:19,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 27 letters. Loop has 20 letters. [2018-11-29 00:03:19,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:19,121 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 825 states and 1090 transitions. [2018-11-29 00:03:19,142 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-11-29 00:03:19,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 825 states to 412 states and 594 transitions. [2018-11-29 00:03:19,158 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155 [2018-11-29 00:03:19,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 179 [2018-11-29 00:03:19,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 412 states and 594 transitions. [2018-11-29 00:03:19,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:19,160 INFO L705 BuchiCegarLoop]: Abstraction has 412 states and 594 transitions. [2018-11-29 00:03:19,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states and 594 transitions. [2018-11-29 00:03:19,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 335. [2018-11-29 00:03:19,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-11-29 00:03:19,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 462 transitions. [2018-11-29 00:03:19,236 INFO L728 BuchiCegarLoop]: Abstraction has 335 states and 462 transitions. [2018-11-29 00:03:19,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-29 00:03:19,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-29 00:03:19,238 INFO L87 Difference]: Start difference. First operand 335 states and 462 transitions. Second operand 10 states. [2018-11-29 00:03:19,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:19,733 INFO L93 Difference]: Finished difference Result 497 states and 787 transitions. [2018-11-29 00:03:19,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-29 00:03:19,737 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 497 states and 787 transitions. [2018-11-29 00:03:19,748 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-11-29 00:03:19,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 497 states to 495 states and 784 transitions. [2018-11-29 00:03:19,764 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 242 [2018-11-29 00:03:19,766 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 242 [2018-11-29 00:03:19,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 495 states and 784 transitions. [2018-11-29 00:03:19,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:19,766 INFO L705 BuchiCegarLoop]: Abstraction has 495 states and 784 transitions. [2018-11-29 00:03:19,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states and 784 transitions. [2018-11-29 00:03:19,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 365. [2018-11-29 00:03:19,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-11-29 00:03:19,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 517 transitions. [2018-11-29 00:03:19,813 INFO L728 BuchiCegarLoop]: Abstraction has 365 states and 517 transitions. [2018-11-29 00:03:19,813 INFO L608 BuchiCegarLoop]: Abstraction has 365 states and 517 transitions. [2018-11-29 00:03:19,813 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-29 00:03:19,813 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 365 states and 517 transitions. [2018-11-29 00:03:19,817 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-29 00:03:19,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:03:19,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:03:19,819 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1] [2018-11-29 00:03:19,819 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:03:19,819 INFO L794 eck$LassoCheckResult]: Stem: 3543#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~ret2, main_~x~0, main_~result~0;main_~x~0 := 5; 3544#L25 call main_#t~ret2 := fibo(main_~x~0);< 3586#fiboENTRY ~n := #in~n; 3598#L6 assume !(~n < 1); 3597#L8 assume !(1 == ~n); 3592#L11 call #t~ret0 := fibo(~n - 1);< 3596#fiboENTRY ~n := #in~n; 3594#L6 assume !(~n < 1); 3595#L8 assume !(1 == ~n); 3555#L11 call #t~ret0 := fibo(~n - 1);< 3589#fiboENTRY ~n := #in~n; 3591#L6 assume !(~n < 1); 3593#L8 assume !(1 == ~n); 3554#L11 call #t~ret0 := fibo(~n - 1);< 3589#fiboENTRY ~n := #in~n; 3590#L6 assume !(~n < 1); 3553#L8 assume 1 == ~n;#res := 1; 3556#fiboFINAL assume true; 3672#fiboEXIT >#32#return; 3617#L11-1 call #t~ret1 := fibo(~n - 2);< 3618#fiboENTRY ~n := #in~n; 3739#L6 assume !(~n < 1); 3736#L8 assume !(1 == ~n); 3737#L11 call #t~ret0 := fibo(~n - 1);< 3749#fiboENTRY ~n := #in~n; 3865#L6 assume !(~n < 1); 3863#L8 assume !(1 == ~n); 3666#L11 call #t~ret0 := fibo(~n - 1);< 3872#fiboENTRY [2018-11-29 00:03:19,819 INFO L796 eck$LassoCheckResult]: Loop: 3872#fiboENTRY ~n := #in~n; 3879#L6 assume !(~n < 1); 3878#L8 assume !(1 == ~n); 3667#L11 call #t~ret0 := fibo(~n - 1);< 3872#fiboENTRY [2018-11-29 00:03:19,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:19,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1902381534, now seen corresponding path program 1 times [2018-11-29 00:03:19,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:19,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:19,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:19,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:03:19,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:20,202 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 45 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-29 00:03:20,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:03:20,203 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:03:20,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:20,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:20,450 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-29 00:03:20,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:03:20,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-11-29 00:03:20,474 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:03:20,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:20,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1420172, now seen corresponding path program 2 times [2018-11-29 00:03:20,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:03:20,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:03:20,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:20,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:03:20,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:03:20,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:20,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:03:20,539 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:20,539 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:20,539 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:20,539 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:20,540 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:03:20,540 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:20,540 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:20,540 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:20,540 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5_true-unreach-call_true-termination.c_Iteration5_Loop [2018-11-29 00:03:20,540 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:20,540 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:20,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:20,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:20,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:20,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:20,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:20,627 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:20,627 INFO L412 LassoAnalysis]: Checking for nontermination... 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 [2018-11-29 00:03:20,631 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:20,632 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:20,635 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:03:20,635 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibo_#t~ret0=0} Honda state: {fibo_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:20,657 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:03:20,657 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 [2018-11-29 00:03:20,682 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:03:20,683 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:03:20,704 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:03:20,707 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:03:20,707 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:03:20,707 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:03:20,707 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:03:20,707 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:03:20,707 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:03:20,708 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:03:20,708 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:03:20,708 INFO L131 ssoRankerPreferences]: Filename of dumped script: fibo_5_true-unreach-call_true-termination.c_Iteration5_Loop [2018-11-29 00:03:20,708 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:03:20,708 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:03:20,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:20,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:20,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:20,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:20,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:03:20,863 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:03:20,864 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:03:20,864 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 [2018-11-29 00:03:20,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:03:20,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:03:20,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:03:20,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:03:20,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:03:20,868 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:03:20,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:03:20,872 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:03:20,876 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:03:20,876 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:03:20,877 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:03:20,877 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:03:20,877 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:03:20,877 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibo_#in~n) = 1*fibo_#in~n Supporting invariants [] [2018-11-29 00:03:20,878 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-29 00:03:20,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:20,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:20,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:21,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:21,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:21,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:03:21,075 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 [2018-11-29 00:03:21,075 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 365 states and 517 transitions. cyclomatic complexity: 159 Second operand 5 states. [2018-11-29 00:03:21,173 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 365 states and 517 transitions. cyclomatic complexity: 159. Second operand 5 states. Result 375 states and 527 transitions. Complement of second has 13 states. [2018-11-29 00:03:21,174 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 [2018-11-29 00:03:21,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-29 00:03:21,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-11-29 00:03:21,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 28 letters. Loop has 4 letters. [2018-11-29 00:03:21,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:21,176 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:03:21,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:21,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:21,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:21,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:21,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:03:21,344 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-29 00:03:21,345 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 365 states and 517 transitions. cyclomatic complexity: 159 Second operand 5 states. [2018-11-29 00:03:21,432 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 365 states and 517 transitions. cyclomatic complexity: 159. Second operand 5 states. Result 375 states and 527 transitions. Complement of second has 13 states. [2018-11-29 00:03:21,441 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 [2018-11-29 00:03:21,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-29 00:03:21,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-11-29 00:03:21,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 28 letters. Loop has 4 letters. [2018-11-29 00:03:21,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:21,443 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:03:21,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:03:21,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:21,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:21,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:03:21,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:03:21,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:03:21,584 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-29 00:03:21,585 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 365 states and 517 transitions. cyclomatic complexity: 159 Second operand 5 states. [2018-11-29 00:03:21,732 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 365 states and 517 transitions. cyclomatic complexity: 159. Second operand 5 states. Result 492 states and 654 transitions. Complement of second has 14 states. [2018-11-29 00:03:21,741 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 [2018-11-29 00:03:21,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-29 00:03:21,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-11-29 00:03:21,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 28 letters. Loop has 4 letters. [2018-11-29 00:03:21,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:21,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 32 letters. Loop has 4 letters. [2018-11-29 00:03:21,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:21,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 28 letters. Loop has 8 letters. [2018-11-29 00:03:21,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:03:21,747 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 492 states and 654 transitions. [2018-11-29 00:03:21,762 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-29 00:03:21,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 492 states to 405 states and 565 transitions. [2018-11-29 00:03:21,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 154 [2018-11-29 00:03:21,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 160 [2018-11-29 00:03:21,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 405 states and 565 transitions. [2018-11-29 00:03:21,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:03:21,777 INFO L705 BuchiCegarLoop]: Abstraction has 405 states and 565 transitions. [2018-11-29 00:03:21,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states and 565 transitions. [2018-11-29 00:03:21,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 389. [2018-11-29 00:03:21,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-11-29 00:03:21,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 541 transitions. [2018-11-29 00:03:21,804 INFO L728 BuchiCegarLoop]: Abstraction has 389 states and 541 transitions. [2018-11-29 00:03:21,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-29 00:03:21,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-11-29 00:03:21,804 INFO L87 Difference]: Start difference. First operand 389 states and 541 transitions. Second operand 20 states. [2018-11-29 00:03:22,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:03:22,692 INFO L93 Difference]: Finished difference Result 169 states and 208 transitions. [2018-11-29 00:03:22,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-29 00:03:22,703 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 208 transitions. [2018-11-29 00:03:22,706 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:03:22,707 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 0 states and 0 transitions. [2018-11-29 00:03:22,707 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-29 00:03:22,707 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-29 00:03:22,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-29 00:03:22,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:03:22,707 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:03:22,707 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:03:22,707 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:03:22,708 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-29 00:03:22,708 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-29 00:03:22,708 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:03:22,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-29 00:03:22,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 12:03:22 BoogieIcfgContainer [2018-11-29 00:03:22,719 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-29 00:03:22,720 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-29 00:03:22,720 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-29 00:03:22,720 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-29 00:03:22,721 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:03:10" (3/4) ... [2018-11-29 00:03:22,727 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-29 00:03:22,727 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-29 00:03:22,728 INFO L168 Benchmark]: Toolchain (without parser) took 12986.42 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 314.0 MB). Free memory was 952.7 MB in the beginning and 1.3 GB in the end (delta: -328.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:03:22,730 INFO L168 Benchmark]: CDTParser took 0.15 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. [2018-11-29 00:03:22,731 INFO L168 Benchmark]: CACSL2BoogieTranslator took 291.51 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-29 00:03:22,731 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.00 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:03:22,733 INFO L168 Benchmark]: Boogie Preprocessor took 20.45 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:03:22,734 INFO L168 Benchmark]: RCFGBuilder took 338.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -163.7 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-11-29 00:03:22,737 INFO L168 Benchmark]: BuchiAutomizer took 12284.38 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 183.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -175.3 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB. [2018-11-29 00:03:22,739 INFO L168 Benchmark]: Witness Printer took 7.85 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:03:22,745 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.15 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 291.51 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 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.00 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.45 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 338.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -163.7 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12284.38 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 183.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -175.3 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB. * Witness Printer took 7.85 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 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 8 terminating modules (4 trivial, 2 deterministic, 2 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 4 locations. One deterministic module has affine ranking function n and consists of 7 locations. One nondeterministic module has affine ranking function n and consists of 7 locations. One nondeterministic module has affine ranking function \old(n) and consists of 5 locations. 4 modules have a trivial ranking function, the largest among these consists of 20 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.1s and 6 iterations. TraceHistogramMax:6. Analysis of lassos took 5.6s. Construction of modules took 1.4s. Büchi inclusion checks took 4.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 7. Automata minimization 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 254 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 365 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/6 HoareTripleCheckerStatistics: 149 SDtfs, 379 SDslu, 185 SDs, 0 SdLazy, 716 SolverSat, 197 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI1 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax100 hnf100 lsp90 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq189 hnf92 smp84 dnf100 smp100 tf110 neg97 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.6s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...